Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts

DOI10.1137/S105262349427652XzbMath0891.90136OpenAlexW2007831912MaRDI QIDQ4377573

Zhi-Quan Luo

Publication date: 10 February 1998

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

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

zbMATH Keywords

column generationanalytic centercutting planesconvex feasibility problempotential reduction

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26)

Related Items (2)

Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method ⋮ Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming

This page was built for publication: Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts