Methods of solving systems of convex programming problems

DOI10.1016/0041-5553(87)90151-0MaRDI QIDQ3815870zbMATH OpenOpenAlexFDO

Authors Anatoliǐ Sergeevich Antipin

Publication date 1987

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(87)90151-0

zbMATH Keywords

decompositionfixed pointLagrangiansaddle point

Mathematics Subject Classification ID

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

Cited in

(7)

• Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method
• Constructing convex solutions via Perron's method
• scientific article; zbMATH DE number 3908176 (Why is no real title available?)
• scientific article; zbMATH DE number 3945896 (Why is no real title available?)
• Solving Convex Programs by Means of Ordinary Differential Equations
• Regularization method for searching for an equilibrium point in two-person saddle-point games with approximate input data
• scientific article; zbMATH DE number 617966 (Why is no real title available?)

This page was built for publication: Methods of solving systems of convex programming problems

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