Towards a Practical Volumetric Cutting Plane Method for Convex Programming

DOI10.1137/S1052623497318013MaRDI QIDQ4229486zbMATH OpenOpenAlexFDO

Authors Kurt M. Anstreicher

Publication date 22 February 1999

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623497318013

zbMATH Keywords

convex programmingcutting plane methodvolumetric barrier

Mathematics Subject Classification ID

Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On Vaidya's Volumetric Cutting Plane Method for Convex Programming
• A projection cutting plane algorithm for convex programming problems
• scientific article; zbMATH DE number 996545
• Cutting plane algorithms for robust conic convex optimization problems
• A cutting plane algorithm for linear reverse convex programs
• scientific article; zbMATH DE number 4005983
• Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
• Variants to the cutting plane approach for convex nondifferentiable optimization
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
• scientific article; zbMATH DE number 1778406

Cited in

(16)

• Packing trees in communication networks
• Method of simple-body centroids
• The volume algorithm: Producing primal solutions with a subgradient method
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
• A cutting plane algorithm for convex programming that uses analytic centers
• An algorithm for solving the convex feasibility problem
• Ellipsoidal approximations of convex sets based on the volumetric barrier
• A unifying framework for several cutting plane methods for semidefinite programming
• On Vaidya's Volumetric Cutting Plane Method for Convex Programming
• Polynomial Interior Point Cutting Plane Methods
• An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
• scientific article; zbMATH DE number 7236423 (Why is no real title available?)
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
• On the volumetric path
• Self-concordant barriers for convex approximations of structured convex sets
• On routing in VLSI design and communication networks

This page was built for publication: Towards a Practical Volumetric Cutting Plane Method for Convex Programming

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