Constrained ?-subgradient method for simultaneous solution of the primal and dual problems of convex programming

DOI10.1007/BF01070129zbMath0746.90051MaRDI QIDQ4005346

Sergei V. Rzhevskii

Publication date: 26 September 1992

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

simultaneous solution

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Finding the nearest point in A polytope
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constrained ?-subgradient method for simultaneous solution of the primal and dual problems of convex programming