Complexity of some cutting plane methods that use analytic centers

DOI10.1007/BF02592145MaRDI QIDQ1352301zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization
• A note on some analytic center cutting plane methods for convex feasibility and minimization problems
• A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
• Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts

Cites work

• scientific article; zbMATH DE number 4041641 (Why is no real title available?)
• scientific article; zbMATH DE number 679864 (Why is no real title available?)
• A Potential Reduction Algorithm Allowing Column Generation
• A cutting plane algorithm for convex programming that uses analytic centers
• A cutting plane method from analytic centers for stochastic programming
• A long-step, cutting plane algorithm for linear and convex programming
• A note on some analytic center cutting plane methods for convex feasibility and minimization problems
• Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
• Complexity estimates of some cutting plane methods based on the analytic barrier
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
• On Vaidya's Volumetric Cutting Plane Method for Convex Programming
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method

Cited in

(9)

• On improvements to the analytic center cutting plane method
• Large-scale optimization with the primal-dual column generation method
• Multiple cuts in the analytic center cutting plane method
• Complexity estimates of some cutting plane methods based on the analytic barrier
• A note on some analytic center cutting plane methods for convex feasibility and minimization problems
• Complexity analysis of the analytic center cutting plane method that uses multiple cuts
• Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts
• On constrained optimization by adjoint based quasi-Newton methods
• Cutting Plane Methods Based on the Analytic Barrier for Minimization of a Convex Function Subject to Box-Constraints

This page was built for publication: Complexity of some cutting plane methods that use analytic centers

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