Extensions of the potential reduction algorithm for linear programming
type: Item
instance of: scholarly article
title: Extensions of the potential reduction algorithm for linear programming
zbMATH Open document ID: 0807.90085
DOI: 10.1007/BF00939838
author: V. Pereyra
published in: Journal of Optimization Theory and Applications
publication date: 1994-11-01T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 653334
zbMATH Keywords: primal and dual problems
zbMATH Keywords: potential reduction algorithm
zbMATH Keywords: potential functions
zbMATH Keywords: analytic center of a polytope
zbMATH Keywords: zero-sum bimatrix game
MaRDI profile type: Publication
cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming
cites work: A Centered Projective Algorithm for Linear Programming
cites work: A new polynomial-time algorithm for linear programming
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
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 polynomial-time algorithm for a class of linear complementarity problems
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: Q5588268
cites work: An interior point potential reduction algorithm for the linear complementarity problem
cites work: Q3725423
cites work: Q3844775
description: scientific article; zbMATH DE number 653334