Complexity of some cutting plane methods that use analytic centers
type: Item
instance of: scholarly article
title: Complexity of some cutting plane methods that use analytic centers
zbMATH Open document ID: 0868.90110
DOI: 10.1007/BF02592145
author: Krzysztof C. Kiwiel
published in: Mathematical Programming. Series A. Series B
publication date: 1997-02-13T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 977967
zbMATH Keywords: nondifferentiable optimization
zbMATH Keywords: cutting plane methods
zbMATH Keywords: box constraints
zbMATH Keywords: accumulated subgradient cuts
zbMATH Keywords: analytic center
MaRDI profile type: Publication
cites work: A note on some analytic center cutting plane methods for convex feasibility and minimization problems
cites work: On Vaidya's Volumetric Cutting Plane Method for Convex Programming
cites work: A cutting plane algorithm for convex programming that uses analytic centers
cites work: A cutting plane method from analytic centers for stochastic programming
cites work: Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
cites work: Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm
cites work: Q4311911
cites work: Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
cites work: A long-step, cutting plane algorithm for linear and convex programming
cites work: Complexity estimates of some cutting plane methods based on the analytic barrier
cites work: Q3780013
cites work: A Potential Reduction Algorithm Allowing Column Generation
full work available at URL: https://doi.org/10.1007/bf02592145
OpenAlex ID: W2001847854
description: scientific article; zbMATH DE number 977967