A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
Authors:
- Jin-Bao JianJJJin-Bao Jian
- Qiao-Fang ChenQCQiao-Fang Chen
- Zong-Wen HuangZHZong-Wen Huang
- 1 June 2014
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 263, 115-128
Abstract
No abstract availableFunding Information
- NSFC (11271086)
- the Natural Science Foundation of Guangxi Province (2011GXNSFD018022)
- Innovation Group of Talents Highland of Guangxi Higher School
This publication has 21 references indexed in Scilit:
- Stabilized SQP revisitedMathematical Programming, 2010
- A new norm-relaxed SQP algorithm with global convergenceApplied Mathematics Letters, 2010
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequencesMathematical Programming, 2007
- A practical update criterion for SQP methodOptimization Methods and Software, 2007
- A feasible descent SQP algorithm for general constrained optimization without strict complementarityJournal of Computational and Applied Mathematics, 2005
- An efficient sequential quadratic programming algorithm for nonlinear programmingJournal of Computational and Applied Mathematics, 2005
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex MinimizationSIAM Journal on Optimization, 2003
- Norm-relaxed method of feasible directions for solving nonlinear programming problemsJournal of Optimization Theory and Applications, 1994
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization ProblemsSIAM Journal on Control and Optimization, 1987
- A successive quadratic programming algorithm with global and superlinear convergence propertiesMathematical Programming, 1986