A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity

DOI10.1016/J.AMC.2009.04.022zbMath1180.65077OpenAlexW2011775228MaRDI QIDQ833162

Xiao-Yan Ke, Wei-Xin Cheng, Jin-Bao Jian

Publication date: 12 August 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.04.022

zbMATH Keywords

algorithmglobal convergencenumerical resultsconstrained optimizationsuperlinear convergenceMaratos effectnorm-relaxed SQP methodsuccessive quadratic programming (SQP) methodMangasarian-Fromovitz constraint qualificationnonlinear optimization with inequalitiesnorm-relaxed methodsub-feasible directions

Mathematics Subject Classification ID

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

Related Items (3)

A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence ⋮ Optimal maximally decimated m-channel mirrored paraunitary linear phase FIR filter bank design via norm relaxed sequential quadratic programming ⋮ On the accurate identification of active set for constrained minimax problems

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• Test examples for nonlinear programming codes
• Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD
• A generalization of the norm-relaxed method of feasible directions
• Norm-relaxed method of feasible directions for solving nonlinear programming problems
• A new SQP method of feasible directions for nonlinear programming.
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• A surperlinearly convergent algorithm for constrained optimization problems
• Combined phase I—phase II methods of feasible directions
• A superlinearly convergent method of feasible directions.

This page was built for publication: A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity