A projection cutting plane algorithm for convex programming problems

DOI10.1016/0096-3003(95)00097-6zbMath0846.65025OpenAlexW1994263016WikidataQ115156478 ScholiaQ115156478MaRDI QIDQ1914623

M. E. Primak, Daniel B. Szyld

Publication date: 23 June 1996

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(95)00097-6

zbMATH Keywords

complexityconvex programmingcutting plane methodsprojection cutting plane algorithm

Mathematics Subject Classification ID

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

Cites Work

• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• The Cutting-Plane Method for Solving Convex Programs
• Location of the Maximum on Unimodal Surfaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A projection cutting plane algorithm for convex programming problems