A class of polynomial variable metric algorithms for linear optimization

DOI10.1007/BF02592202MaRDI QIDQ1814798zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A polynomial algorithm for convex quadratic optimization subject to linear inequalities
• A variable-metric variant of the Karmarkar algorithm for linear programming
• Polynomial affine algorithms for linear programming
• scientific article; zbMATH DE number 4062814
• A polynomial-time algorithm for affine variational inequalities
• scientific article; zbMATH DE number 3847231
• scientific article; zbMATH DE number 617915
• Towards a Genuinely Polynomial Algorithm for Linear Programming
• scientific article; zbMATH DE number 2201985
• scientific article; zbMATH DE number 4119927

Cites work

• scientific article; zbMATH DE number 4197739 (Why is no real title available?)
• A multiplicative barrier function method for linear programming
• A new polynomial-time algorithm for linear programming
• A proof of the polynomiality of the Iri-Imai method
• 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
• Minimizing a differentiable function over a differential manifold
• Nonlinear coordinate representations of smooth optimization problems
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• On the convexity of the multiplicative version of Karmarkar's potential function
• Polynomial affine algorithms for linear programming
• 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

Cited in

(7)

• Proximal Point Algorithm On Riemannian Manifolds
• Nonlinear coordinate representations of smooth optimization problems
• 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
• Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization
• A polynomial-time algorithm for affine variational inequalities

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814798)