A new norm-relaxed SQP algorithm with global convergence

DOI10.1016/j.aml.2010.02.005zbMath1186.90088OpenAlexW2076636122MaRDI QIDQ972949

Jin-Bao Jian, Hai-Yan Zheng, Ran Quan, Chun-Ming Tang

Publication date: 21 May 2010

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2010.02.005

zbMATH Keywords

global convergence\(l_\infty \) penalty functionnorm-relaxed SQP

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (2)

Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems ⋮ A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences

Cites Work

• Unnamed Item
• Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
• 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.
• A variant of SQP method for inequality constrained optimization and its global convergence
• A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm

This page was built for publication: A new norm-relaxed SQP algorithm with global convergence