Items where Author is "Dadush, Daniel"

Number of items: 15.
  • A strongly polynomial algorithm for linear programs with at most two nonzero entries per row or column. (2024) Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Olver, Neil; Végh, László A. picture_as_pdf
  • An accelerated Newton–Dinkelbach method and its application to two variables per inequality systems. (2023) Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A. picture_as_pdf
  • Fast, deterministic and sparse dimensionality reduction. Dadush, Daniel; Guzmán, Cristóbal; Olver, Neil
  • Geometric rescaling algorithms for submodular function minimization. Dadush, Daniel; Végh, László A.; Zambelli, Giacomo picture_as_pdf
  • Geometric rescaling algorithms for submodular function minimization. Dadush, Daniel; Végh, László A.; Zambelli, Giacomo picture_as_pdf
  • Interior point methods are not worse than simplex. Allamigeon, Xavier; Dadush, Daniel; Loho, Georg; Natura, Bento; Végh, László A. picture_as_pdf
  • Majorizing measures for the optimizer. Borst, Sander; Dadush, Daniel; Olver, Neil; Sinha, Makrand picture_as_pdf
  • On circuit diameter bounds via circuit imbalances. Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A A.
  • On finding exact solutions of linear programs in the oracle model. Dadush, Daniel; Végh, László A.; Zambelli, Giacomo picture_as_pdf
  • Rescaled coordinate descent methods for linear programming. Dadush, Daniel; Végh, László A.; Zambelli, Giacomo
  • Rescaling algorithms for linear conic feasibility. Dadush, Daniel; Végh, László A.; Zambelli, Giacomo picture_as_pdf
  • Revisiting Tardos's framework for linear programming:faster exact solutions using approximate solvers. Dadush, Daniel; Natura, Bento; Végh, László A. picture_as_pdf
  • An accelerated Newton-dinkelbach method and its application to two variables per inequality systems. Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A. picture_as_pdf
  • A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Dadush, Daniel; Huiberts, Sophie; Natura, Bento; Végh, László A. picture_as_pdf
  • A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Dadush, Daniel; Huiberts, Sophie; Natura, Bento; Végh, László A. picture_as_pdf