Failure of global convergence for a class of interior point methods for nonlinear programming
From MaRDI portal
Publication:1587941
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
Cited in
(36)- A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- scientific article; zbMATH DE number 5233132 (Why is no real title available?)
- Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
- Initial guess sensitivity in computational optimal control problems
- Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity
- Optimization-based approach to path planning for closed chain robot systems
- Constrained dogleg methods for nonlinear systems with simple bounds
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
- On the convergence of Newton iterations to non-stationary points
- Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
- On some interior-point algorithms for nonconvex quadratic optimization
- Inner solvers for interior point methods for large scale nonlinear programming
- An overview of nonlinear optimization
- Global convergence of the Newton interior-point method for nonlinear programming
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
- Study of a primal-dual algorithm for equality constrained minimization
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
- An interior-point piecewise linear penalty method for nonlinear programming
- Primal-dual interior-point method for thermodynamic gas-particle partitioning
- Optimal management of a bioreactor for eutrophicated water treatment: a numerical approach
- A line search exact penalty method using steering rules
- An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
- The penalty interior-point method fails to converge
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)