A logarithmic barrier cutting plane method for convex programming
type: Item
instance of: scholarly article
title: A logarithmic barrier cutting plane method for convex programming
zbMATH Open document ID: 0836.90126
DOI: 10.1007/BF02032162
author: D. Den Hertog
author: C. Roos
author: John A. Kaliski
author: Tamás Terlaky
published in: Annals of Operations Research
publication date: 1996-05-02T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 90C34
zbMATH DE Number: 830134
zbMATH Keywords: column generation
zbMATH Keywords: decomposition
zbMATH Keywords: interior point method
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: logarithmic barrier cutting plane algorithm
zbMATH Keywords: central path of a linear relaxation
describes a project that uses: ACCPM
MaRDI profile type: Publication
cites work: Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
cites work: Newton's method for convex programming and Tschebyscheff approximation
cites work: A projected lagrangian algorithm for semi-infinite programming
cites work: A central cutting plane algorithm for the convex programming problem
cites work: Q3932564
cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm
cites work: Q3858016
cites work: Cutting planes and column generation techniques with the projective algorithm
cites work: Q3208448
cites work: Q4296156
cites work: A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
cites work: A build-up variant of the logarithmic barrier method for LP
cites work: Q4840104
cites work: A Short-Cut Potential Reduction Algorithm for Linear Programming
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
cites work: A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
cites work: Q4206561
cites work: Solving combinatorial optimization problems using Karmarkar's algorithm
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: A polynomial method of approximate centers for linear programming
cites work: A Potential Reduction Algorithm Allowing Column Generation
full work available at URL: https://doi.org/10.1007/bf02032162
OpenAlex ID: W2054876264
description: scientific article; zbMATH DE number 830134