A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
From MaRDI portal
Publication:1960196
DOI10.1007/s10107-009-0272-yzbMath1205.90272OpenAlexW2023122478MaRDI QIDQ1960196
Publication date: 13 October 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0272-y
global convergencequadratic convergenceinterior-point methodssuperlinear convergencegeneral nonlinear optimizationnull-space steprange-space step
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items
An overview of nonlinear optimization ⋮ On the behaviour of constrained optimization methods when Lagrange multipliers do not exist ⋮ A globally convergent primal-dual interior-point relaxation method for nonlinear programs ⋮ A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs ⋮ A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs ⋮ A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints.
- Test examples for nonlinear programming codes
- An interior-point algorithm for nonconvex nonlinear programming
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- On the convergence of Newton iterations to non-stationary points
- Failure of global convergence for a class of interior point methods for nonlinear programming
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- A robust sequential quadratic programming method
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- A primal-dual trust region algorithm for nonlinear optimization
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
- Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Numerical Optimization
- On the Stability of Null-Space Methods for KKT Systems
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- A Robust Algorithm for Optimization with General Equality and Inequality Constraints
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
- Interior Methods for Nonlinear Optimization
- A globally convergent primal-dual interior point method for constrained optimization
- A trust region method based on interior point techniques for nonlinear programming.
- Nonlinear programming without a penalty function.
