A projected-search interior-point method for nonlinearly constrained optimization
From MaRDI portal
Publication:6498408
DOI10.1007/S10589-023-00549-1MaRDI QIDQ6498408
Publication date: 7 May 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Test examples for nonlinear programming codes
- A primal-dual trust region algorithm for nonlinear optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Multiplier and gradient methods
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
- Stability of Augmented System Factorizations in Interior-Point Methods
- Flexible penalty functions for nonlinear constrained optimization
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- CUTE
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Stability of Linear Equations Solvers in Interior-Point Methods
- Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization
- A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- On the Performance of SQP Methods for Nonlinear Optimization
- CUTEr and SifDec
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Benchmarking optimization software with performance profiles.
This page was built for publication: A projected-search interior-point method for nonlinearly constrained optimization
