One method of solving the convex programming problem

DOI10.1007/BF01069607zbMath0467.90056OpenAlexW2080453030MaRDI QIDQ3921002

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

rate of convergenceLagrangiansuperlinear convergenceconvergence acceleration technique

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

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

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