Successive linear programming
Successive Linear Programming (SLP), also known as Sequential Linear Programming, is an optimization technique for approximately solving nonlinear optimization problems.[1]
Starting at some estimate of the optimal solution, the method is based on solving a sequence of first-order approximations (i.e. linearizations) of the model. The linearizations are linear programming problems, which can be solved efficiently. As the linearizations need not be bounded, trust regions or similar techniques are needed to ensure convergence in theory. [2]
SLP has been used widely in the petrochemical industry since the 1970s.[3]
See also
References
- ↑ Nocedal, Jorge; Wright J., Stephen (October 1999), "Numerical Optimization", Springer Series in Operations Research Chapter 15.1, Categorizing Optimization Algorithms
- ↑ Bazaraa, Mokhtar S.; Sheraly, Hanif D.; Shetty, C.M. (1993), Nonlinear Programming, Theory and Applications (2nd ed.), John Wiley & Sons, p. 432, ISBN 0-471-55793-5.
- ↑ Palacios-Gomez, F.; Lasdon, L.; Enquist, M. (October 1982), "Nonlinear Optimization by Successive Linear Programming", Management Science 28 (10), doi:10.1287/mnsc.28.10.1106
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
This article is issued from Wikipedia - version of the Friday, November 13, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.