A class of polynomial variable metric algorithms for linear optimization

DOI10.1007/BF02592202zbMath0855.90084OpenAlexW1972707344MaRDI QIDQ1814798

T. T. Thang, Tamás Rapcsák

Publication date: 31 October 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592202

zbMATH Keywords

interior point algorithmsRiemannian metricspolynomial variable metric algorithmsvariable metric method approach

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items (6)

Proximal Point Algorithm On Riemannian Manifolds ⋮ Nonlinear coordinate representations of smooth optimization problems ⋮ Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization ⋮ Singularities of monotone vector fields and an extragradient-type algorithm ⋮ Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds ⋮ Subgradient algorithm on Riemannian manifolds

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A multiplicative barrier function method for linear programming
• On the convexity of the multiplicative version of Karmarkar's potential function
• Minimizing a differentiable function over a differential manifold
• A survey of search directions in interior point methods for linear programming
• Integrability of vector and multivector fields associated with interior point methods for linear programming
• A proof of the polynomiality of the Iri-Imai method
• Polynomial affine algorithms for linear programming
• Nonlinear coordinate representations of smooth optimization problems
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories

This page was built for publication: A class of polynomial variable metric algorithms for linear optimization