Complexity analysis of the analytic center cutting plane method that uses multiple cuts
From MaRDI portal
Publication:1373727
DOI10.1016/S0025-5610(96)00075-5zbMath0890.90152OpenAlexW4231459397MaRDI QIDQ1373727
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0025-5610(96)00075-5
complexityconvex feasibility problemseparation oraclecolumn generation algorithmpotential reductionanalytic center cutting plane
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
A second-order cone cutting surface method: Complexity and application, A matrix generation approach for eigenvalue optimization, Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities, An efficient descent direction method with cutting planes, A \(J\)-symmetric quasi-Newton method for minimax problems, A cutting plane method for solving KYP-SDPs, Specialized fast algorithms for IQC feasibility and optimization problems., Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms, Using selective orthonormalization to update the analytic center after addition of multiple cuts, An oracle for the discrete-time integral quadratic constraint problem, 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, An analytic center cutting plane algorithm for finding equilibrium points
