Complexity analysis of the analytic center cutting plane method that uses multiple cuts

DOI10.1016/S0025-5610(96)00075-5zbMATH Open0890.90152OpenAlexW4231459397MaRDI QIDQ1373727FDOQ1373727

Authors: Yinyu Ye 

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

Recommendations

• Complexity of some cutting plane methods that use analytic centers
• Multiple cuts in the analytic center cutting plane method
• Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts
• Complexity estimates of some cutting plane methods based on the analytic barrier
• The Analytic Center Cutting Plane Method with Semidefinite Cuts
• Multiple cuts with a homogeneous analytic center cutting plane method
• A two-cut approach in the analytic center cutting plane method
• A cutting plane algorithm for convex programming that uses analytic centers
• Cutting plane selection with analytic centers and multiregression
• A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems

zbMATH Keywords

complexityconvex feasibility problemcolumn generation algorithmseparation oraclepotential reductionanalytic center cutting plane

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (19)

• On improvements to the analytic center cutting plane method
• A second-order cone cutting surface method: Complexity and application
• A matrix generation approach for eigenvalue optimization
• Multiple cuts in the analytic center cutting plane method
• Complexity estimates of some cutting plane methods based on the analytic barrier
• Multiple cuts with a homogeneous analytic center cutting plane method
• 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 efficient descent direction method with cutting planes
• An analytic center cutting plane algorithm for finding equilibrium points
• Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
• Using selective orthonormalization to update the analytic center after addition of multiple cuts
• A cutting plane method for solving KYP-SDPs
• An oracle for the discrete-time integral quadratic constraint problem
• Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities
• Specialized fast algorithms for IQC feasibility and optimization problems.
• Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts
• A \(J\)-symmetric quasi-Newton method for minimax problems
• Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems

This page was built for publication: Complexity analysis of the analytic center cutting plane method that uses multiple cuts

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