Towards a Practical Volumetric Cutting Plane Method for Convex Programming

DOI10.1137/S1052623497318013zbMath1032.90525OpenAlexW1992404387MaRDI QIDQ4229486

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)

Related Items (9)

An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ On routing in VLSI design and communication networks ⋮ Polynomial Interior Point Cutting Plane Methods ⋮ On the volumetric path ⋮ Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices ⋮ Self-concordant barriers for convex approximations of structured convex sets ⋮ A unifying framework for several cutting plane methods for semidefinite programming ⋮ Packing trees in communication networks

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