A feasible trust region SQP method with nonmonotone line search for inequality constrained optimization

zbMATH Open1249.90267MaRDI QIDQ2886642FDOQ2886642

Authors: Zhongbo Sun, Fujian Duan 

Publication date: 1 June 2012

Published in: Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)

Recommendations

• A superlinearly convergent trust region-SQP algorithm for inequality constrained optimization
• An efficient feasible SQP algorithm for inequality constrained optimization
• A simple feasible SQP algorithm for inequality constrained optimization
• A feasible trust region algorithm with fast convergence for nonlinear inequality constrained optimization
• A type of efficient feasible SQP algorithms for inequality constrained optimization

zbMATH Keywords

global convergencetrust region methodsuperlinear convergencenonmonotone line searchSQP method

Mathematics Subject Classification ID

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

Cited In (3)

• A superlinearly convergent trust region-SQP algorithm for inequality constrained optimization
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates

This page was built for publication: A feasible trust region SQP method with nonmonotone line search for inequality constrained optimization

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