Software For Nonlinearly Constrained Optimization
- 1 January 2011
- book chapter
- Published by Wiley
Abstract
We categorize and survey software packages for solving constrained nonlinear optimization problems, including interior-point methods, sequential linear/quadratic programming methods, and augmented Lagrangian methods. In each case, we highlight the main methodological components and provide a brief summary of interfaces and availability.Keywords
This publication has 29 references indexed in Scilit:
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimizationComputational Optimization and Applications, 2007
- Knitro: An Integrated Package for Nonlinear Optimization2006
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programmingMathematical Programming, 2005
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global ConvergenceSIAM Journal on Optimization, 2005
- Line Search Filter Methods for Nonlinear Programming: Local ConvergenceSIAM Journal on Optimization, 2005
- A globally convergent primal-dual interior-point filter method for nonlinear programmingMathematical Programming, 2003
- Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit FunctionsComputational Optimization and Applications, 2002
- A trust region method based on interior point techniques for nonlinear programmingMathematical Programming, 2000
- An Interior-Point Algorithm for Nonconvex Nonlinear ProgrammingComputational Optimization and Applications, 1999
- An Interior Point Algorithm for Large-Scale Nonlinear ProgrammingSIAM Journal on Optimization, 1999