Short-step methods are not strongly polynomial-time

DOI10.1007/S10107-023-02002-XMaRDI QIDQ6608050FDOQ6608050

Authors: Manru Zong, Yin Tat Lee, Man-Chung Yue 

Publication date: 19 September 2024

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

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Title not available (Why is that?)
• Lectures on convex optimization
• Log-Barrier Interior Point Methods Are Not Strongly Polynomial

This page was built for publication: Short-step methods are not strongly polynomial-time

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