On the length of primal-dual projection of potential reduction algorithm

DOI10.1080/02331939508844102MaRDI QIDQ4888265zbMATH OpenOpenAlexFDO

Authors

Publication date 28 July 1996

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939508844102

zbMATH Keywords

potential reduction algorithmsprojection

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Near boundary behavior of primal-dual potential reduction algorithms for linear programming
• On the worst case complexity of potential reduction algorithms for linear programming
• A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
• scientific article; zbMATH DE number 4197744
• scientific article; zbMATH DE number 1047677

Cites work

• A new polynomial-time algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• Linear programming and the Newton barrier flow

This page was built for publication: On the length of primal-dual projection of potential reduction algorithm

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