Interior-point methods with decomposition for solving large-scale linear programs
type: Item
instance of: scholarly article
title: Interior-point methods with decomposition for solving large-scale linear programs
zbMATH Open document ID: 0974.90028
DOI: 10.1023/A:1021850714072
published in: Journal of Optimization Theory and Applications
publication date: 2001-12-16T00:00:00Z
review text: The author investigates an implementable algorithm suitable for solving large-scale programs which combines the interior-point method with the Dantzig-Wolfe decomposition one. It is proved that the algorithm under consideration has polynomial-time complexity and is globally linearly convergent.
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 49M27
zbMATH DE Number: 1347776
zbMATH Keywords: large-scale linear programming
zbMATH Keywords: interior-point methods
zbMATH Keywords: Dantzig-Wolfe decomposition
zbMATH Keywords: algorithmic complexity
author: Gongyun Zhao
reviewed by: Wiesław Kotarski
MaRDI profile type: Publication
cites work: Q3844775
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: Q4324980
cites work: Q3141900
cites work: Approximations in proximal bundle methods and decomposition of convex programs
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
cites work: Path-Following Methods for Linear Programming
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
cites work: Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
cites work: Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming
cites work: Exploiting special structure in a primal-dual path-following algorithm
cites work: Exploiting special structure in Karmarkar's linear programming algorithm
full work available at URL: a:1021850714072
OpenAlex ID: W1936682102
description: scientific article; zbMATH DE number 1347776