Modified cutting plane method for minimization of a convex function

DOI10.1007/BF02733226zbMath0916.90222OpenAlexW1971132266MaRDI QIDQ1280984

É. I. Nenakhov, B. N. Pshenichnyĭ, V. N. Kuz'menko

Publication date: 15 March 1999

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02733226

zbMATH Keywords

linearizationcutting plane methodcutting hyperplanes

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (2)

Mixed method for solving the general convex programming problem ⋮ A multipoint method of minimization of a convex function

Cites Work

• Convergence of the method of Chebyshev centers and some applications
• Sufficient conditions for extremum, penalty functions and regularity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Modified cutting plane method for minimization of a convex function