On Vaidya's Volumetric Cutting Plane Method for Convex Programming
From MaRDI portal
Publication:4339373
DOI10.1287/moor.22.1.63zbMath0871.90061OpenAlexW1993007823MaRDI QIDQ4339373
Publication date: 9 June 1997
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.22.1.63
Related Items (13)
Complexity of some cutting plane methods that use analytic centers ⋮ A note on approximation of a ball by polytopes ⋮ First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems ⋮ Models and algorithms for distributionally robust least squares problems ⋮ Complexity of optimizing over the integers ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming ⋮ A utility theory based interactive approach to robustness in linear optimization ⋮ Polynomial Interior Point Cutting Plane Methods ⋮ On complexity of the translational-cut algorithm for convex minimax problems ⋮ On the volumetric path ⋮ Solving the discrete \(l_p\)-approximation problem by a method of centers ⋮ A note on some analytic center cutting plane methods for convex feasibility and minimization problems
This page was built for publication: On Vaidya's Volumetric Cutting Plane Method for Convex Programming
