A class of polynomial variable metric algorithms for linear optimization
type: Item
instance of: scholarly article
title: A class of polynomial variable metric algorithms for linear optimization
zbMATH Open document ID: 0855.90084
DOI: 10.1007/BF02592202
author: T. T. Thang
author: Tamás Rapcsák
published in: Mathematical Programming. Series A. Series B
publication date: 1996-10-31T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 940775
zbMATH Keywords: interior point algorithms
zbMATH Keywords: variable metric method approach
zbMATH Keywords: polynomial variable metric algorithms
zbMATH Keywords: Riemannian metrics
MaRDI profile type: Publication
cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
cites work: The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
cites work: A survey of search directions in interior point methods for linear programming
cites work: Minimizing a differentiable function over a differential manifold
cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
cites work: Polynomial affine algorithms for linear programming
cites work: On the convexity of the multiplicative version of Karmarkar's potential function
cites work: Integrability of vector and multivector fields associated with interior point methods for linear programming
cites work: A proof of the polynomiality of the Iri-Imai method
cites work: A multiplicative barrier function method for linear programming
cites work: A new polynomial-time algorithm for linear programming
cites work: Q5202838
cites work: Nonlinear coordinate representations of smooth optimization problems
full work available at URL: https://doi.org/10.1007/bf02592202
OpenAlex ID: W1972707344
Recommended article: A polynomial algorithm for convex quadratic optimization subject to linear inequalities
Recommended article: A variable-metric variant of the Karmarkar algorithm for linear programming
Recommended article: Polynomial affine algorithms for linear programming
Recommended article: Q3796957
Recommended article: A polynomial-time algorithm for affine variational inequalities
Recommended article: Q3316973
Recommended article: Q4302054
Recommended article: Towards a Genuinely Polynomial Algorithm for Linear Programming
Recommended article: Q5314208
Recommended article: Q4733661
description: scientific article; zbMATH DE number 940775