On motivating the Mitchell-Todd modification of Karmarkar's algorithm for LP problems with free variables

DOI10.1007/BF02191992zbMath0823.90085OpenAlexW2018990949MaRDI QIDQ1893338

Héctor Martínez

Publication date: 3 July 1995

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

free variablesKarmarkar algorithmextended scaling

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (2)

Fidelity between one bipartite quantum state and another undergoing local unitary dynamics ⋮ Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique

Cites Work

• A new polynomial-time algorithm for linear programming
• Conical projection algorithms for linear programming
• A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables

This page was built for publication: On motivating the Mitchell-Todd modification of Karmarkar's algorithm for LP problems with free variables