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

DOI10.1137/S105262349427652XMaRDI QIDQ4377573zbMATH OpenOpenAlexFDO

Authors 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

cutting planescolumn generationconvex feasibility problemanalytic centerpotential reduction

Mathematics Subject Classification ID

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

Recommendations

• Complexity analysis of the analytic center cutting plane method that uses multiple cuts
• A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
• Complexity of some cutting plane methods that use analytic centers
• A note on some analytic center cutting plane methods for convex feasibility and minimization problems
• Multiple cuts with a homogeneous analytic center cutting plane method

Cited in

(7)

• On improvements to the analytic center cutting plane method
• Multiple cuts in the analytic center cutting plane method
• Shallow, deep and very deep cuts in the analytic center cutting plane method.
• An analytic center cutting plane approach for conic programming
• 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
• Complexity analysis of the analytic center cutting plane method that uses multiple cuts

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377573)