An accelerated interior point method whose running time depends only on A (extended abstract)

DOI10.1145/195058.195248zbMATH Open1345.90059OpenAlexW1998407808MaRDI QIDQ2817643FDOQ2817643

Authors: Yinyu Ye, Stephen A. Vavasis 

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195058.195248

Recommendations

• A primal-dual interior point method whose running time depends only on the constraint matrix
• A new polynomial-time algorithm for linear programming
• A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming
• Interior path following primal-dual algorithms. I: Linear programming
• A Low Complexity Interior-Point Algorithm for Linear Programming

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25)

Cited In (5)

• Title not available (Why is that?)
• Some variants of the Todd low-complexity algorithm
• A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming
• Title not available (Why is that?)
• Condition numbers for polyhedra with real number data

This page was built for publication: An accelerated interior point method whose running time depends only on \(A\) (extended abstract)

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