Failure of global convergence for a class of interior point methods for nonlinear programming
From MaRDI portal
Publication:1587941
DOI10.1007/S101070000181zbMATH Open0963.65063MaRDI QIDQ1587941FDOQ1587941
Andreas Wächter, Lorenz T. Biegler
Publication date: 3 July 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- Global convergence in infeasible-interior-point algorithms
- On the global convergence of interior-pointnonlinear programming algorithms
- A globally convergent interior point algorithm for non-convex nonlinear programming
- Global convergence of the Newton interior-point method for nonlinear programming
- Convergence analysis of the inexact infeasible interior-point method for linear optimization
- Convergence of a class of inexact interior-point algorithms for linear programs
- Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
- The penalty interior-point method fails to converge
- Global convergence of a primal-dual interior-point method for nonlinear programming
- From global to local convergence of interior methods for nonlinear optimization
algorithmsinterior point methodsnonlinear programmingglobal convergencenonlinear nonconvex optimization
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Cited In (36)
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
- Primal-dual interior-point method for thermodynamic gas-particle partitioning
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Inner solvers for interior point methods for large scale nonlinear programming
- The penalty interior-point method fails to converge
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
- A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- A line search exact penalty method using steering rules
- Global convergence of the Newton interior-point method for nonlinear programming
- An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
- Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- Title not available (Why is that?)
- Optimization-based approach to path planning for closed chain robot systems
- On the convergence of Newton iterations to non-stationary points
- An overview of nonlinear optimization
- On some interior-point algorithms for nonconvex quadratic optimization
- Optimal management of a bioreactor for eutrophicated water treatment: a numerical approach
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- Initial guess sensitivity in computational optimal control problems
- Study of a primal-dual algorithm for equality constrained minimization
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
- An interior-point piecewise linear penalty method for nonlinear programming
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- Constrained dogleg methods for nonlinear systems with simple bounds
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
This page was built for publication: Failure of global convergence for a class of interior point methods for nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587941)
