On one class of iterational methods for solving problems of convex programming

DOI10.1016/0041-5553(84)90039-9MaRDI QIDQ3682253zbMATH OpenOpenAlexFDO

Authors

Publication date 1984

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(84)90039-9

zbMATH Keywords

modified Lagrange functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cited in

(3)

• Iterative algorithm for solving a class of convex feasibility problem
• A general iterative scheme with applications to convex optimization and related fields
• A class of problems for which cyclic relaxation converges linearly

This page was built for publication: On one class of iterational methods for solving problems of convex programming

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