Complexity of some cutting plane methods that use analytic centers

DOI10.1007/BF02592145zbMath0868.90110OpenAlexW2001847854MaRDI QIDQ1352301

Krzysztof C. Kiwiel

Publication date: 13 February 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

box constraintsnondifferentiable optimizationanalytic centercutting plane methodsaccumulated subgradient cuts

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items

Large-scale optimization with the primal-dual column generation method

Cites Work

• 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 note on some analytic center cutting plane methods for convex feasibility and minimization problems
• 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
• Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
• A long-step, cutting plane algorithm for linear and convex programming
• Unnamed Item
• Unnamed Item