A long-step, cutting plane algorithm for linear and convex programming

DOI10.1023/A:1019288816566zbMath0990.90133OpenAlexW2133473041MaRDI QIDQ5933831

Srinivasan Ramaswamy, John E. Mitchell

Publication date: 14 June 2001

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019288816566

zbMATH Keywords

linear programmingconvex programmingpath followinganalytic centercutting plane

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Interior-point methods (90C51) Combinatorial optimization (90C27) Semi-infinite programming (90C34)

Related Items (4)

Analytic center cutting plane methods for variational inequalities over convex bodies ⋮ Complexity of some cutting plane methods that use analytic centers ⋮ Polynomial Interior Point Cutting Plane Methods ⋮ Using selective orthonormalization to update the analytic center after addition of multiple cuts

Uses Software

• ACCPM

This page was built for publication: A long-step, cutting plane algorithm for linear and convex programming