Convergence of SQP-Like Methods for Constrained Optimization

DOI10.1137/0327002MaRDI QIDQ3835308zbMATH OpenOpenAlexFDO

Authors

Publication date 1989

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0327002

zbMATH Keywords

active constraint identificationconstrained optimizationlocal minimizersSequential quadratic programming

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 4213744
• scientific article; zbMATH DE number 3965826
• scientific article; zbMATH DE number 780774
• scientific article; zbMATH DE number 123327
• Global convergence on an active set SQP for inequality constrained optimization

Cited in

(6)

• Global convergence on an active set SQP for inequality constrained optimization
• Convergence of sequential approximation method for constrained optimization problems
• scientific article; zbMATH DE number 4213744 (Why is no real title available?)
• Projected Sequential Quadratic Programming Methods
• Convergence of the BFGS-SQP Method for Degenerate Problems
• Finite convergence of algorithms for nonlinear programs and variational inequalities

This page was built for publication: Convergence of SQP-Like Methods for Constrained Optimization

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