A note on some analytic center cutting plane methods for convex feasibility and minimization problems

DOI10.1007/BF00249055zbMath0859.90102OpenAlexW2048133466MaRDI QIDQ1815078

Krzysztof C. Kiwiel, Anna Altman

Publication date: 10 April 1997

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00249055

zbMATH Keywords

box constraintsnondifferentiable optimizationcomplexity estimatesseparation oracleconvex feasibility problemscutting plane methodscomplexity of an analytic center algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52)

Related Items

Large-scale optimization with the primal-dual column generation method, Complexity of some cutting plane methods that use analytic centers, An analytic center cutting plane method for pseudomonotone variational inequalities, Distributionally robust portfolio optimization with second-order stochastic dominance based on Wasserstein metric, Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method, Homogeneous analytic center cutting plane methods with approximate centers

Cites Work

• Unnamed Item
• Unnamed Item
• Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• A cutting plane algorithm for convex programming that uses analytic centers
• A cutting plane method from analytic centers for stochastic programming
• Complexity estimates of some cutting plane methods based on the analytic barrier
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• A Potential Reduction Algorithm Allowing Column Generation
• On Vaidya's Volumetric Cutting Plane Method for Convex Programming