scientific article; zbMATH DE number 31673

MaRDI QIDQ3987734zbMATH OpenFDO

Authors Hiroshi Yabe, Naokazu Yamaki, Satoru Takahashi

Publication date 28 June 1992

zbMATH Keywords

constrained optimizationglobal convergenceKarush-Kuhn-Tucker conditionssequential inexact quadratic programmingsuperlinear convergence

Mathematics Subject Classification ID

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

Recommendations

• Global and superlinear convergence of inexact sequential quadratically constrained quadratic programming method for convex programming
• scientific article; zbMATH DE number 1919456
• On the global convergence for a variant of SQP method
• A modified SQP method and its global convergence

Cited in

(6)

• Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
• Global convergence on an active set SQP for inequality constrained optimization
• An inexact restoration strategy for the globalization of the sSQP method
• scientific article; zbMATH DE number 5987581 (Why is no real title available?)
• A Strategy for Global Convergence in a Sequential Quadratic Programming Algorithm
• A quadratically approximate framework for constrained optimization, global and local convergence

This page was built for publication:

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