A class of convex programming methods

DOI10.1016/0041-5553(86)90087-XMaRDI QIDQ3765562zbMATH OpenOpenAlexFDO

Authors E. A. Nurminskii

Publication date 1986

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(86)90087-x

zbMATH Keywords

\(\epsilon \)-subgradient pointwise-multiple mappingleast scalar rootseparating planes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• Separating plane algorithms for convex optimization
• scientific article; zbMATH DE number 195045
• scientific article; zbMATH DE number 3850830
• scientific article; zbMATH DE number 3847229
• scientific article; zbMATH DE number 3892945

Cited in

(5)

• A forward convex-simplex method
• A row-action method for convex programming
• Separating plane algorithms for convex optimization
• scientific article; zbMATH DE number 1166327 (Why is no real title available?)
• scientific article; zbMATH DE number 195139 (Why is no real title available?)

This page was built for publication: A class of convex programming methods

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