A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems
DOI10.1007/S11590-015-0863-XzbMATH Open1332.90281OpenAlexW1964668433MaRDI QIDQ499683FDOQ499683
Authors: Björn Sachsenberg, Klaus Schittkowski 
Publication date: 6 October 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0863-x
Recommendations
- A new SQP algorithm for large-scale nonlinear programming
- SQP methods for large-scale nonlinear programming
- A simple decomposition based SQP algorithm for large scale nonlinear programming
- Partially reduced sqp methods for large-scale nonlinear optimization problems
- On the performance of SQP methods for nonlinear optimization
- A feasible SQP method for nonlinear programming
- scientific article; zbMATH DE number 653036
- scientific article; zbMATH DE number 938975
- scientific article; zbMATH DE number 1014538
- An SQP method for general nonlinear complementarity problems
interior point methodsnonlinear programminglarge-scale optimizationnumerical testssequential quadratic programming methods
Methods of successive quadratic programming type (90C55) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Cites Work
- LAPACK Users' Guide
- LOQO:an interior point code for quadratic programming
- On the limited memory BFGS method for large scale optimization
- Title not available (Why is that?)
- Optimization theory and methods. Nonlinear programming
- Interior point methods 25 years later
- Title not available (Why is that?)
- A trust region method based on interior point techniques for nonlinear programming.
- More test examples for nonlinear programming codes
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- Title not available (Why is that?)
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
- Optimization techniques for solving elliptic control problems with control and state constraints. I: Boundary control
- Global convergence of a primal-dual interior-point method for nonlinear programming
- Optimization techniques for solving elliptic control problems with control and state constraints. II: Distributed control
- A comparative performance evaluation of 27 nonlinear programming codes
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
- Adaptive Barrier Update Strategies for Nonlinear Interior Methods
Cited In (2)
Uses Software
This page was built for publication: A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499683)
