A globally convergent primal-dual interior-point relaxation method for nonlinear programs
From MaRDI portal
Publication:5216730
DOI10.1090/mcom/3487zbMath1440.90074arXiv1807.02959OpenAlexW2971646932WikidataQ127297833 ScholiaQ127297833MaRDI QIDQ5216730
Publication date: 18 February 2020
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.02959
global convergenceinterior-point methodconstrained optimizationnonlinear programminglogarithmic barrier problem
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items (4)
IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming ⋮ An overview of nonlinear optimization ⋮ 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
- A primal-dual augmented Lagrangian
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- Test example for nonlinear programming codes
- An interior-point algorithm for nonconvex nonlinear programming
- 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 convergent primal-dual interior-point filter method for nonlinear programming
- On the convergence of a new trust region algorithm
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- A penalty-interior-point algorithm for nonlinear constrained optimization
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear 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
- An interior point method for nonlinear programming with infeasibility detection capabilities
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection
- An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization
- A Trust Region Algorithm for Nonlinearly Constrained Optimization
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Numerical Optimization
- CUTE
- 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
- Why a Pure Primal Newton Barrier Step May be Infeasible
- Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
- A globally convergent primal-dual interior point method for constrained optimization
- A trust region method based on interior point techniques for nonlinear programming.
This page was built for publication: A globally convergent primal-dual interior-point relaxation method for nonlinear programs
