A superlinearly convergent trust region-SQP algorithm for inequality constrained optimization

zbMATH Open1324.90155MaRDI QIDQ5259882FDOQ5259882

Authors Zhongbo Sun, Fujian Duan, Chunling Xu, Yantao Tian

Publication date 29 June 2015

zbMATH Keywords

global convergencesuperlinear convergenceMaratos effecttrust region-SQP method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A feasible trust region SQP method with nonmonotone line search for inequality constrained optimization
• An SQP algorithm with trust region for nonlinear constrained optimization
• A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization.
• An SQP algorithm with equality constrained subproblems for nonlinear inequality constrained optimization
• A feasible SQP algorithm with superlinear convergence for inequality constrained optimization

Cited in

(6)

• Superlinear convergence of a trust region type successive linear programming method
• A feasible trust region SQP method with nonmonotone line search for inequality constrained optimization
• A superlinearly convergent trust region algorithm for \(LC^1\) constrained optimization problems
• An SQP algorithm with trust region for nonlinear constrained optimization
• A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control
• scientific article; zbMATH DE number 1942631 (Why is no real title available?)

This page was built for publication: A superlinearly convergent trust region-SQP algorithm for inequality constrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259882)