WikiLean

Diff — Nonlinear programming

Revision #5441 → #5442 · back to history

addednonlinear programmingb794149a8919
addedoptimization problem739124c6dc75
addednonlinear programming subfieldc42c510c4b6e
addednonlinear programming problem setupaec3239b96bc
addednonlinear programming problem form5155451574bb
addedfeasible problem472434a06ea8
addedinfeasible problemdd272ba3e2ea
addedinfeasible constraints are contradictory36d2bdf4b2c5
addedunbounded problem8c0c79cc3738
addedunbounded problem has no optimumc5497e3cf9c5
addedfeasibility violation handling098fc8d5bdf5
addedconvex nonlinear programc194803130f3
addedconvex optimization methods apply17f186e2475a
addedquadratic programming caseaa997238d2c1
addedfractional programming transformationd7fce7dd3d71
addedtransportation cost optimizationf8f6acd6fdff
addedpetroleum product transportbc852ed34b5f
addedbatch size discontinuities69b7263cb9d3
addedlinear data analysis examplee6646fa803d8
addeddata fitting is generally nonlinear2dbee9aba9e3
addednumerical best fitef712e75aac7
addedKKT necessary conditionsfa2b845ee022
addedsubdifferential KKT conditionscb2a01ce6707
addedKKT sufficient under convexity0aec5ae0ab1c
addedKKT local sufficiency without convexity35021a964bdd
addedfinite local optima can be enumerated5d0c8fd6eee3
addediterative numerical methods1a6784288f6e
addedzero-order routines57951297fa77
addedfirst-order routines841008c7afd1
addedsecond-order routinesb36423015749
addedhigher-order routines not used617bd962c8e9
addedbranch and bound method7e47edcfe37f
addedbranch and bound optimality certificatea40b3886e274
addedε-optimal point96de7a7db54b
addedε-optimal terminationb818c2cdb0b1
addedALGLIB nonlinear programming solver29b1e1257ade
addedNLopt nonlinear programming solver0c5688ed2a79
addedSciPy nonlinear programming solverc7bd4eb189ca
addedIPOPT nonlinear programming solver47af1858af5a
addedSNOPT proprietary solver85f34545c133
added2-dimensional nonlinear programming problemcceacb862061
added3-dimensional nonlinear programming problem3bf1bb17caa3