A projection cutting plane algorithm for convex programming problems

DOI10.1016/0096-3003(95)00097-6MaRDI QIDQ1914623zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
• A logarithmic barrier cutting plane method for convex programming
• Complexity of some cutting plane methods that use analytic centers
• Polynomial Interior Point Cutting Plane Methods

Cites work

• scientific article; zbMATH DE number 3790207 (Why is no real title available?)
• scientific article; zbMATH DE number 4123531 (Why is no real title available?)
• scientific article; zbMATH DE number 1220208 (Why is no real title available?)
• scientific article; zbMATH DE number 3185418 (Why is no real title available?)
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• Location of the Maximum on Unimodal Surfaces
• The Cutting-Plane Method for Solving Convex Programs

Cited in

(10)

• A long-step, cutting plane algorithm for linear and convex programming
• Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
• Using projected cutting planes in the extended cutting plane method
• scientific article; zbMATH DE number 1778406 (Why is no real title available?)
• A logarithmic barrier cutting plane method for convex programming
• A Cutting Plane Algorithm for Min-Max Fractional Programming
• Projective cutting-planes
• On global optimality conditions and cutting plane algorithms
• scientific article; zbMATH DE number 4176856 (Why is no real title available?)
• Towards a Practical Volumetric Cutting Plane Method for Convex Programming

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

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