On the volumetric path

DOI10.1007/s11590-011-0293-3zbMath1257.90044OpenAlexW2006094122MaRDI QIDQ691484

Murat Mut, Tamás Terlaky

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0293-3

zbMATH Keywords

logarithmic barrier functionanalytic centercentral pathvolumetric centervolumetric barrier functionvolumetric path

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• A cutting plane algorithm for convex programming that uses analytic centers
• How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
• The Volumetric Barrier for Semidefinite Programming
• Towards a Practical Volumetric Cutting Plane Method for Convex Programming
• On Vaidya's Volumetric Cutting Plane Method for Convex Programming
• On the Convergence of the Central Path in Semidefinite Optimization

This page was built for publication: On the volumetric path