On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods
From MaRDI portal
Publication:5880389
DOI10.1080/02331934.2021.1981893OpenAlexW3202565487MaRDI QIDQ5880389
Publication date: 9 March 2023
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.1981893
perturbation theoryeigenvalue estimatebarrier problemboundedness away from zerostabilized interior point method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function
- A stabilized filter SQP algorithm for nonlinear programming
- Stabilized SQP revisited
- Eigenvalue estimates for saddle point matrices of Hermitian and indefinite leading blocks
- An interior-point trust-funnel algorithm for nonlinear optimization
- Lifting mathematical programs with complementarity constraints
- Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints
- Combining stabilized SQP with the augmented Lagrangian algorithm
- On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Stabilized sequential quadratic programming
- Stability in the presence of degeneracy and error estimation
- Error bounds in mathematical programming
- On the solution of mathematical programming problems with equilibrium constraints
- Constraint identification and algorithm stabilization for degenerate nonlinear programs
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- An interior point method for nonlinear optimization with a quasi-tangential subproblem
- A primal-dual regularized interior-point method for convex quadratic programs
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
- An inexact restoration strategy for the globalization of the sSQP method
- Convergence of a stabilized SQP method for equality constrained optimization
- 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
- Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
- Solution sensitivity for Karush–Kuhn–Tucker systems with non-unique Lagrange multipliers
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- Constraint Preconditioners for Symmetric Indefinite Matrices
- Spectral Analysis of Saddle Point Matrices with Indefinite Leading Blocks
- A Preconditioned Iterative Method for Saddlepoint Problems
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Accurate Symmetric Indefinite Linear Equation Solvers
- Fast Iterative Solution of Stabilised Stokes Systems Part II: Using General Block Preconditioners
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- A stabilized SQP method: global convergence
- Modifying SQP for Degenerate Problems
- A globally convergent primal-dual interior point method for constrained optimization
- Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods
- On the Classical Necessary Second-Order Optimality Conditions in the Presence of Equality and Inequality Constraints
- An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- A Globally Convergent Stabilized SQP Method
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Global Optimization and Constraint Satisfaction
- A trust region method based on interior point techniques for nonlinear programming.
