Failure of global convergence for a class of interior point methods for nonlinear programming
From MaRDI portal
Publication:1587941
DOI10.1007/s101070000181zbMath0963.65063MaRDI QIDQ1587941
Andreas Wächter, Lorenz T. Biegler
Publication date: 3 July 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
algorithmsglobal convergencenonlinear programminginterior point methodsnonlinear nonconvex optimization
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items
Unnamed Item, A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming, A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization, Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints, Inner solvers for interior point methods for large scale nonlinear programming, A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm, Primal-dual interior point QP-free algorithm for nonlinear constrained optimization, Initial guess sensitivity in computational optimal control problems, Optimal management of a bioreactor for eutrophicated water treatment: a numerical approach, Constrained dogleg methods for nonlinear systems with simple bounds, Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity, An overview of nonlinear optimization, An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness, A line search exact penalty method using steering rules, A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties, Global convergence of the Newton interior-point method for nonlinear programming, Study of a primal-dual algorithm for equality constrained minimization, Optimization-based approach to path planning for closed chain robot systems, Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts, Primal-dual interior-point method for thermodynamic gas-particle partitioning, An interior-point piecewise linear penalty 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, Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming, A globally convergent primal-dual interior-point relaxation method for nonlinear programs, Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods, 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, Global convergence enhancement of classical linesearch interior point methods for MCPs, A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints