Polynomial Interior Point Cutting Plane Methods

From MaRDI portal





First, cutting plane methods for the convex feasibility problem are investigated. Then, the methods are applied to the convex optimization problems. The cutting plane methods find an approximate analytic or volumetric center of a working set which is a polytope containing the feasible region and call a separation oracle at this approximate center to determine whether additional constraints should be added to the current working set. Typically, these cutting plane methods exhibit polynomial convergence. The volumetric cutting plane method achieves the theoretical minimum number of calls to a separation oracle. Long-step versions of the methods for solving convex optimization problems are presented.



Cites work


Cited in
(25)


Describes a project that uses

Uses Software






This page was built for publication: Polynomial Interior Point Cutting Plane Methods

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