Global convergence of an SQP algorithm for nonlinear optimization with overdetermined constraints

DOI10.3934/NACO.2012.2.19zbMATH Open1254.90227OpenAlexW2316443268MaRDI QIDQ449533FDOQ449533

Authors: Chunlin Hao, Xinwei Liu 

Publication date: 30 August 2012

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2012.2.19

Recommendations

• scientific article; zbMATH DE number 5987581
• A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.
• Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
• scientific article; zbMATH DE number 780774
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming

zbMATH Keywords

global convergenceoverdetermined system of equationssequential quadratical programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Cited In (3)

• Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
• Title not available (Why is that?)
• Global convergence on an active set SQP for inequality constrained optimization

This page was built for publication: Global convergence of an SQP algorithm for nonlinear optimization with overdetermined constraints

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