Convergence of a stabilized SQP method for equality constrained optimization

DOI10.1007/s10589-019-00096-8zbMath1414.90330OpenAlexW2938929624MaRDI QIDQ2419576

Songqiang Qiu

Publication date: 13 June 2019

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-019-00096-8

zbMATH Keywords

global convergencelocal convergencestabilized sequential quadratic programmingequality constrained optimizationtrust-funnel-like method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items (2)

On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods ⋮ A globally convergent regularized interior point method for constrained optimization

Uses Software

• SNOPT
• AMPL
• Ipopt
• ALGENCAN

Cites Work

• Unnamed Item
• Unnamed Item
• A Modeling Language for Mathematical Programming
• A globally convergent penalty-free method for optimization with equality constraints and simple bounds
• Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function
• A stabilized filter SQP algorithm for nonlinear programming
• Matrix-free interior point method
• Stabilized SQP revisited
• An interior-point trust-funnel algorithm for nonlinear optimization
• A stabilized SQP method: superlinear convergence
• Global and local convergence of a class of penalty-free-type methods for nonlinear programming
• Nonlinear programming without a penalty function or a filter
• Test examples for nonlinear programming codes
• Superlinear convergence of a stabilized SQP method to a degenerate solution
• Stabilized sequential quadratic programming
• A primal-dual regularized interior-point method for convex quadratic programs
• Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
• Subspace-stabilized sequential quadratic programming
• An inexact restoration strategy for the globalization of the sSQP method
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Optimization theory and methods. Nonlinear programming
• Sequential Quadratic Programming Methods
• A Cone-Continuity Constraint Qualification and Algorithmic Consequences
• A Preconditioned Iterative Method for Saddlepoint Problems
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Fast Iterative Solution of Stabilised Stokes Systems Part II: Using General Block Preconditioners
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• Newton-Type Methods for Optimization Problems without Constraint Qualifications
• A stabilized SQP method: global convergence
• Modifying SQP for Degenerate Problems
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
• A Globally Convergent Stabilized SQP Method
• Practical Augmented Lagrangian Methods for Constrained Optimization
• On sequential optimality conditions for smooth constrained optimization
• Nonlinear programming without a penalty function.

This page was built for publication: Convergence of a stabilized SQP method for equality constrained optimization