Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
The local convergence properties of a class of primal-dual interior point methods are analyzed. These methods are designed to minimize a nonlinear, nonconvex, objective function subject to linear equality constraints and general inequalities. They involve an inner iteration in which the log-barrier merit function is approximately minimized subject to satisfying the linear equality constraints, and an outer iteration that specifies both the decrease in the barrier parameter and the level of accuracy for the inner minimization. Under nondegeneracy assumptions, it is shown that, assymptotically, for each value of the barrier parameter, solving a single primal-dual linear system is enough to produce an iterate that already matches the barrier subproblem accuracy requirements. The asymptotic rate of convergence of the resulting algorithm is Q-superlinear and may be chosen particularly for the method described by \textit{A. R. Conn, N. I. M. Gould, D. Orban}, and \textit{P. L. Toint} [Math. Program. 87B, No. 2, 215-249 (2000; Zbl 0970.90116)] and indicate that the details of its inner minimization are irrelevant in the asymptotics, except for its accuracy requirements.
- scientific article; zbMATH DE number 1183039
- A primal-dual interior point method for nonlinear optimization: Global convergence, convergence rate and numerical performance for large scale problems
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Superlinear convergence of infeasible-interior-point methods for linear programming
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
- An interior-point algorithm for linear optimization based on a new barrier function
- A filter interior-point algorithm with projected Hessian updating for nonlinear optimization
- Superlinear convergence of interior-point algorithms for semidefinite programming
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- On the characterization of \(Q\)-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
- A proximal interior point algorithm with applications to image processing
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
- Local analysis of the feasible primal-dual interior-point method
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- Reduced order output feedback control design for PDE systems using proper orthogonal decomposition and nonlinear semidefinite programming
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
- Filling holes under non-linear constraints
- A primal-dual interior point method for nonlinear optimization: Global convergence, convergence rate and numerical performance for large scale problems
- Global convergence of a primal-dual interior-point method for nonlinear programming
- From global to local convergence of interior methods for nonlinear optimization
- A Globally and Superlinearly Convergent Primal-dual Interior Point Method for General Constrained Optimization
- Assessing the potential of interior point barrier filter line search methods: nonmonotone versus monotone approach
- Structure-exploiting interior point methods
- scientific article; zbMATH DE number 4199963 (Why is no real title available?)
- An interior-point _1-penalty method for nonlinear optimization
- Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems
- General primal-dual penalty/barrier path-following Newton methods for nonlinear programming
- A penalized interior point approach for constrained nonlinear programming
- scientific article; zbMATH DE number 1186888 (Why is no real title available?)
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- A general class of penalty/barrier path-following Newton methods for nonlinear programming
- A two-step primal-dual interior point method for nonlinear semidefinite programming problems and its superlinear convergence
- On second-order optimality conditions for nonlinear programming
- On the superlinear convergence order of the logarithmic barrier algorithm
- Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity
- A closed-loop symplectic regularized algorithm for constrained time-varying optimal control
- Convergence analysis of a mixed logarithmic barrier-augmented Lagrangian algorithm without constraint qualification
- Sphere of convergence of Newton's method on two equivalent systems from nonlinear programming.
- A decomposition framework for nonlinear nonconvex two-stage optimization
- A primal-dual interior point trust region method for second-order stationary points of Riemannian inequality-constrained optimization problems
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
- A note on the use of vector barrier parameters for interior-point methods
- A local convergence property of primal-dual methods for nonlinear programming
This page was built for publication: Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2719236)
