Constrained Optimization Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "(1997)." to "(1997).") |
m (Text replacement - " “" to " “") |
||
Line 16: | Line 16: | ||
=== 1997 === | === 1997 === | ||
* ([[1997_OptimizationByVectorSpaceMethods|Luenberger, 1997]]) ⇒ David G. Luenberger. ([[1997]]). | * ([[1997_OptimizationByVectorSpaceMethods|Luenberger, 1997]]) ⇒ David G. Luenberger. ([[1997]]). “[http://books.google.com/books?id=lZU0CAH4RccC Optimization by Vector Space Methods]." Wiley Professional. ISBN:047118117X | ||
---- | ---- |
Revision as of 18:57, 15 January 2019
A Constrained Optimization Algorithm is an optimization algorithm that can be applied by an constrained optimization system (to solve a constrained optimization task).
- Example(s):
- a Lagrangian Method, such as ADMM.
- a Penalty Method.
- an Interior Point Method.
- See: Vector Space, Constraint Rule, Unconstrained Optimization Algorithm, Geometric Optimality Conditions, Fritz John Conditions, Karush–Kuhn–Tucker Conditions, Linear Programming, Simplex Method, Polynomial Time, Quadratic Programming, Ellipsoid Method, Convex Function.
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/constrained_optimization#Solution_methods Retrieved:2015-11-8.
- Many unconstrained optimization algorithms can be adapted to the constrained case, often via the use of a penalty method. However, search steps taken by the unconstrained method may be unacceptable for the constrained problem, leading to a lack of convergence. This is referred to as the Maratos effect. [1]
1997
- (Luenberger, 1997) ⇒ David G. Luenberger. (1997). “Optimization by Vector Space Methods." Wiley Professional. ISBN:047118117X