Necessary and sufficient convergence conditions for a class of nonlinear programming methods

MaRDI QIDQ677375zbMATH OpenFDO

Authors A. Yu. Gorchakov, G. G. Kotkin

Publication date 21 April 1997

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

zbMATH Keywords

sequential methodsgeometric interpretationconvergence of methods

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 4031416
• Necessary and sufficient conditions for convergence of iteration algorithms of nonlinear programming
• An overall study of convergence conditions for algorithms in nonlinear programming
• scientific article; zbMATH DE number 4008109
• Convergence properties of descent methods for unconstrained minization

Cited in

(6)

• Necessary and sufficient conditions for convergence of iteration algorithms of nonlinear programming
• On the convergence of the conditional gradient method in distributed optimization problems
• scientific article; zbMATH DE number 4008109 (Why is no real title available?)
• scientific article; zbMATH DE number 4018159 (Why is no real title available?)
• scientific article; zbMATH DE number 4031416 (Why is no real title available?)
• Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point

This page was built for publication: Necessary and sufficient convergence conditions for a class of nonlinear programming methods

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