SNOPT
SNOPT: An SQP algorithm for large-scale constrained optimization. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first derivatives are available and that the constraint gradients are sparse. We discuss an SQP algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility in the original problem and the QP subproblems. SNOPT is a particular implementation that makes use of a semidefinite QP solver. It is based on a limited-memory quasi-Newton approximation to the Hessian of the Lagrangian and uses a reduced-Hessian algorithm (SQOPT) for solving the QP subproblems. It is designed for problems with many thousands of constraints and variables but a moderate number of degrees of freedom (say, up to 2000). An important application is to trajectory optimization in the aerospace industry. Numerical results are given for most problems in the CUTE and COPS test collections (about 900 examples).
Keywords for this software
References in zbMATH (referenced in 433 articles , 1 standard article )
Showing results 1 to 20 of 433.
Sorted by year (- Bock, Hans Georg; Kirches, Christian; Meyer, Andreas; Potschka, Andreas: Numerical solution of optimal control problems with explicit and implicit switches (2018)
- Branda, Martin; Bucher, Max; Červinka, Michal; Schwartz, Alexandra: Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization (2018)
- Dalkiran, Evrim; Ghalami, Laleh: On linear programming relaxations for solving polynomial programming problems (2018)
- Duarte, Belmiro P. M.; Sagnol, Guillaume; Wong, Weng Kee: An algorithm based on semidefinite programming for finding minimax optimal designs (2018)
- Duarte, Belmiro P. M.; Wong, Weng Kee; Dette, Holger: Adaptive grid semidefinite programming for finding optimal designs (2018)
- He, Ping; Mader, Charles A.; Martins, Joaquim R. R. A.; Maki, Kevin J.: An aerodynamic design optimization framework using a discrete adjoint approach with OpenFOAM (2018)
- Kılınç, Mustafa R.; Sahinidis, Nikolaos V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (2018)
- Ledoit, Olivier; Wolf, Michael: Optimal estimation of a large-dimensional covariance matrix under Stein’s loss (2018)
- Putkaradze, Vakhtang; Rogers, Stuart: Constraint control of nonholonomic mechanical systems (2018)
- Semmler, Johannes; Pflug, Lukas; Stingl, Michael: Material optimization in transverse electromagnetic scattering applications (2018)
- Shi-Dong, Doug; Nadarajah, Siva: Approximate Hessian for accelerated convergence of aerodynamic shape optimization problems in an adjoint-based framework (2018)
- Torrisi, Giampaolo; Grammatico, Sergio; Smith, Roy S.; Morari, Manfred: A projected gradient and constraint linearization method for nonlinear model predictive control (2018)
- Xiao, Long; Liu, Xinggao; Ma, Liang; Zhang, Zeyin: An effective pseudospectral method for constraint dynamic optimisation problems with characteristic times (2018)
- Zeng, Zhi-Zhong; Yu, Xin-Guo; Chen, Mao; Liu, Yuan-Yuan: A memetic algorithm to pack unequal circles into a square (2018)
- Alipour, Khalil; Daemi, Parisa; Hassanpour, Arman; Tarvirdizadeh, Bahram: On the capability of wheeled mobile robots for heavy object manipulation considering dynamic stability constraints (2017)
- Armand, Paul; Omheni, Riadh: A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (2017)
- Curtis, Frank E.; Gould, Nicholas I. M.; Robinson, Daniel P.; Toint, Philippe L.: An interior-point trust-funnel algorithm for nonlinear optimization (2017)
- Fan, Jinyan; Zhou, Anwa: A semidefinite algorithm for completely positive tensor decomposition (2017)
- Hansen, Pierre; Mladenović, Nenad; Todosijević, Raca; Hanafi, Saïd: Variable neighborhood search: basics and variants (2017)
- Jian, Jinbao; Zeng, Hanjun; Ma, Guodong; Zhu, Zhibin: Primal-dual interior point QP-free algorithm for nonlinear constrained optimization (2017)