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 410 articles , 1 standard article )
Showing results 1 to 20 of 410.
Sorted by year (- Duarte, Belmiro P. M.; Wong, Weng Kee; Dette, Holger: Adaptive grid semidefinite programming for finding optimal designs (2018)
- Putkaradze, Vakhtang; Rogers, Stuart: Constraint control of nonholonomic mechanical systems (2018)
- 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)
- Jian, Jinbao; Zeng, Hanjun; Ma, Guodong; Zhu, Zhibin: Primal-dual interior point QP-free algorithm for nonlinear constrained optimization (2017)
- Kaya, C.Yalçın: Markov-Dubins path via optimal control theory (2017)
- Khan, Kamil A.; Watson, Harry A.J.; Barton, Paul I.: Differentiable McCormick relaxations (2017)
- Mummolo, Carlotta; Mangialardi, Luigi; Kim, Joo H.: Numerical estimation of balanced and falling states for constrained legged systems (2017)
- Pang, Lili; Zhu, Detong: A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization (2017)
- Ribeiro, Ademir A.; Sachine, Mael; Santos, Sandra A.: On the augmented subproblems within sequential methods for nonlinear programming (2017)
- Sun, Hailin; Su, Che-Lin; Chen, Xiaojun: SAA-regularized methods for multiproduct price optimization under the pure characteristics demand model (2017)
- Tang, Xiaojun; Shi, Yang; Wang, Li-Lian: A new framework for solving fractional optimal control problems using fractional pseudospectral methods (2017)
- Verschueren, Robin; Zanon, Mario; Quirynen, Rien; Diehl, Moritz: A sparsity preserving convexification procedure for indefinite quadratic programs arising in direct optimal control (2017)
- Wan, Wei; Biegler, Lorenz T.: Structured regularization for barrier NLP solvers (2017)
- Zhao, Xiao; Noack, Stephan; Wiechert, Wolfgang; von Lieres, Eric: Dynamic flux balance analysis with nonlinear objective function (2017)
- Araya, Ignacio; Reyes, Victor: Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (2016)
- Arreckx, Sylvain; Lambe, Andrew; Martins, Joaquim R.R.A.; Orban, Dominique: A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization (2016)
- Betts, John T.; Campbell, Stephen L.; Thompson, Karmethia C.: Solving optimal control problems with control delays using direct transcription (2016)
- Bolte, Jér^ome; Pauwels, Edouard: Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs (2016)