Complexity estimates of some cutting plane methods based on the analytic barrier
type: Item
instance of: scholarly article
title: Complexity estimates of some cutting plane methods based on the analytic barrier
zbMATH Open document ID: 0857.90103
DOI: 10.1007/BF01585556
author: Yanyan Li
published in: Mathematical Programming. Series A. Series B
publication date: 1996-09-18T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 928073
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: self-concordant functions
zbMATH Keywords: efficiency estimates
zbMATH Keywords: cutting plane methods
zbMATH Keywords: analytic barrier
zbMATH Keywords: rate of convergence
Wikidata QID: Q92953184
MaRDI profile type: Publication
cites work: A cutting plane algorithm for convex programming that uses analytic centers
cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm
cites work: A new polynomial-time algorithm for linear programming
cites work: Q4182272
cites work: Location of the Maximum on Unimodal Surfaces
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Q3780013
cites work: An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
cites work: A new algorithm for minimizing convex functions over convex sets
cites work: A Potential Reduction Algorithm Allowing Column Generation
cites work: Q4097094
Recommended article: Complexity of some cutting plane methods that use analytic centers
Recommended article: Complexity analysis of the analytic center cutting plane method that uses multiple cuts
Recommended article: Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
Recommended article: On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
Recommended article: Cutting plane algorithms and approximate lower subdifferentiability
Recommended article: Cutting Plane Methods Based on the Analytic Barrier for Minimization of a Convex Function Subject to Box-Constraints
Recommended article: Computer Science Logic
Recommended article: Q4797517
Recommended article: A cutting plane method from analytic centers for stochastic programming
description: scientific article; zbMATH DE number 928073