One method of solving the convex programming problem

DOI10.1007/BF01069607MaRDI QIDQ3921002zbMATH OpenOpenAlexFDO

Authors B. N. Pshenichnyĭ

Publication date 1980

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01069607

zbMATH Keywords

convergence acceleration techniqueLagrangianrate of convergencesuperlinear convergence

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Cites work

• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Multiplier and gradient methods

Cited in

(2)

• Geometrical and topological methods in optimal control theory
• Optimization of discrete inclusions with distributed parameters

This page was built for publication: One method of solving the convex programming problem

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