A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs

DOI10.1007/s00186-022-00797-7OpenAlexW4293860233MaRDI QIDQ2105288

Yakui Huang, Yu-Hong Dai, Xin-Wei Liu

Publication date: 8 December 2022

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.10803

zbMATH Keywords

nonlinear programmingglobal and local convergencesmoothing methodmini-max probleminterior-point relaxation methodlogarithmic-barrier problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items (2)

IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming ⋮ A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints

Uses Software

• LANCELOT
• CUTEr
• ipfilter
• Ipopt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• LANCELOT
• An interior-point trust-funnel algorithm for nonlinear optimization
• A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
• Nonlinear programming without a penalty function or a filter
• Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
• Test examples for nonlinear programming codes
• An interior-point algorithm for nonconvex nonlinear programming
• Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
• 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
• A primal-dual trust region algorithm for nonlinear optimization
• A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
• 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
• Optimization theory and methods. Nonlinear programming
• An interior point method for nonlinear programming with infeasibility detection capabilities
• A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
• A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection
• An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization
• Adaptive Barrier Update Strategies for Nonlinear Interior Methods
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• On the Implementation of a Primal-Dual Interior Point Method
• Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
• Numerical Optimization
• CUTE
• A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
• An Interior Point Algorithm for Large-Scale Nonlinear Programming
• A globally convergent primal-dual interior-point relaxation method for nonlinear programs
• A trust region method based on interior point techniques for nonlinear programming.
• Benchmarking optimization software with performance profiles.

This page was built for publication: A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs