Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
type: Item
instance of: scholarly article
title: Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
zbMATH Open document ID: 0948.90137
DOI: 10.1016/S0168-9274(98)00103-2
author: Zhi-Quan Luo
author: C. Roos
author: Tamás Terlaky
published in: Applied Numerical Mathematics
publication date: 2000-11-27T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 49M30
zbMATH DE Number: 1311301
zbMATH Keywords: column generation
MaRDI profile type: Publication
cites work: A cutting plane algorithm for convex programming that uses analytic centers
cites work: Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
cites work: A cutting plane method from analytic centers for stochastic programming
cites work: A central cutting plane algorithm for the convex programming problem
cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm
cites work: Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
cites work: Q4311911
cites work: Q4192594
cites work: Q4296156
cites work: A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
cites work: A logarithmic barrier cutting plane method for convex programming
cites work: A build-up variant of the logarithmic barrier method for LP
cites work: Q4840104
cites work: A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
cites work: Q4735039
cites work: Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
cites work: Polynomial algorithms in linear programming
cites work: On the complexity of approximating the maximal inscribed ellipsoid for a polytope
cites work: Q5535546
cites work: Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts
cites work: Q5202851
cites work: On computing the center of a convex quadratically constrained set
cites work: Solving combinatorial optimization problems using Karmarkar's algorithm
cites work: Q4324980
cites work: Q3967358
cites work: Complexity estimates of some cutting plane methods based on the analytic barrier
cites work: A polynomial method of approximate centers for linear programming
cites work: Q5187067
cites work: Q4204004
cites work: Q3780013
cites work: A Potential Reduction Algorithm Allowing Column Generation
cites work: Complexity analysis of the analytic center cutting plane method that uses multiple cuts
full work available at URL: s0168-9274(98)00103-2
OpenAlex ID: W1992586141
description: scientific article; zbMATH DE number 1311301