Skip to main content

Scaling Methods for Discrete and Continuous Optimization

Deliverables

Searching for OpenAIRE data...

Publications

An Accelerated Newton-Dinkelbach Method and its Application to Two Variables Per Inequality Systems

Author(s): Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A.
Published in: 29th Annual European Symposium on Algorithms (ESA 2021), 36, 2021, Page(s) 1-15
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.48550/arxiv.2004.08634

On complete classes of valuated matroids

Author(s): Husić, Edin; Loho, Georg; Smith, Ben; Végh, László A.
Published in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Page(s) 945-962
Publisher: SIAM
DOI: 10.1137/1.9781611977073.41

A Faster Interior-Point Method for Sum-Of-Squares Optimization

Author(s): Jiang, Shunhua ; Natura, Bento ; Weinstein, Omri
Published in: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), 79, 2022, Page(s) 1-20
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.icalp.2022.79

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees

Author(s): Koh, Zhuan Khye; Loho, Georg
Published in: 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)., 63, 2022, Page(s) 1-15
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.mfcs.2022.63

Chaos of Learning Beyond Zero-sum and Coordination via Game Decompositions

Author(s): Cheung, Yun Kuen; Tao, Yixin
Published in: ICLR 2021, 2021
Publisher: ICLR

The Evolution of Uncertainty of Learning in Games

Author(s): Cheung, Yun Kuen; Piliouras, Georgios; Tao, Yixin
Published in: ICLR 2022, 2022
Publisher: ICLR

A strongly polynomial algorithm for linear exchange markets

Author(s): Jugal Garg, László A. Végh
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Page(s) 54-65, ISBN 9781-450367059
Publisher: ACM Press
DOI: 10.1145/3313276.3316340

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Author(s): Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Page(s) 761-774, ISBN 9781-450369794
Publisher: ACM
DOI: 10.1145/3357713.3384326?cid=81100084130

Signed Tropical Convexity

Author(s): Georg Loho, László A. Végh
Published in: Proceedings of the 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 24, 2020, Page(s) 1-35
Publisher: LIPIcs–Leibniz International Proceedings in Informatics
DOI: 10.4230/lipics.itcs.2020.24

Directed Shortest Paths via Approximate Cost Balancing

Author(s): James B. Orlin, László A. Végh
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 235-254, ISBN 978-1-61197-646-5
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.16

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and their Applications

Author(s): Jugal Garg, Edin Husić, László A. Végh
Published in: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)., 33, 2021, Page(s) 1-19
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing
DOI: 10.4230/lipics.stacs.2021.33

On finding exact solutions of linear programs in the oracle model

Author(s): Dadush, Daniel; Végh, László A.; Zambelli, Giacomo
Published in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Page(s) 2700-2722
Publisher: SIAM
DOI: 10.1137/1.9781611977073.106

Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets

Author(s): Jugal Garg, Yixin Tao, László A. Végh
Published in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Page(s) 2269-2284
Publisher: SIAM
DOI: 10.1137/1.9781611977073.91

On Circuit Diameter Bounds via Circuit Imbalances

Author(s): Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Végh, László A.
Published in: IPCO 2022: Integer Programming and Combinatorial Optimization, 2022, Page(s) 140-153
Publisher: Springer
DOI: 10.1007/978-3-031-06901-7_11

Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers

Author(s): Daniel Dadush, Bento Natura, László A. Végh
Published in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Page(s) 931-942
Publisher: IEEE
DOI: 10.1109/focs46700.2020.00091

The Pareto Cover Problem

Author(s): Natura, Bento; Neuwohner, Meike; Weltge, Stefan
Published in: 30th Annual European Symposium on Algorithms (ESA 2022), 80, 2022, Page(s) 1-12
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.esa.2022.80

Approximating Nash Social Welfare under Rado Valuations

Author(s): Jugal Garg, Edin Husic, László A. Végh
Published in: STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Page(s) 1412-1425
Publisher: ACM SIGACT
DOI: 10.1145/3406325.3451031

Interior point methods are not worse than Simplex

Author(s): Allamigeon, Xavier; Dadush, Daniel; Loho, Georg; Natura, Bento; Végh, László A.
Published in: To appear in the proceedings of FOCS 2022, 2022
Publisher: IEEE
DOI: 10.48550/arxiv.2206.08810

Patchworking Oriented Matroids

Author(s): Marcel Celaya, Georg Loho, Chi Ho Yuen
Published in: Journal of the London Mathematical Society, (2) 2022, 2022, Page(s) 1-32, ISSN 1469-7750
Publisher: London Mathematical Society
DOI: 10.1112/jlms.12667

Rescaling Algorithms for Linear Conic Feasibility

Author(s): Daniel Dadush, László A. Végh, Giacomo Zambelli
Published in: Mathematics of Operations Research, 45/2, 2020, Page(s) 732-754, ISSN 0364-765X
Publisher: Institute for Operations Research and the Management Sciences
DOI: 10.1287/moor.2019.1011

Geometric Rescaling Algorithms for Submodular Function Minimization

Author(s): Daniel Dadush, László A. Végh, Giacomo Zambelli
Published in: Mathematics of Operations Research, (accepted), 2020, ISSN 0364-765X
Publisher: Institute for Operations Research and the Management Sciences

A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization

Author(s): Neil Olver, László A. Végh
Published in: Journal of the ACM, 67/2, 2020, Page(s) 1-26, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3383454

A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

Author(s): Ola Svensson, Jakub Tarnawski, László A. Végh
Published in: Journal of the ACM, 67/6, 2020, Page(s) 1-53, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3424306

Tropical Ehrhart Theory and Tropical Volume

Author(s): Georg Loho, Matthias Schymura
Published in: Research in the Mathematical Sciences, 7, 2020, ISSN 2197-9847
Publisher: Springer
DOI: 10.1007/s40687-020-00228-1

Face posets of tropical polyhedra and monomial ideals

Author(s): Georg Loho, Ben Smith
Published in: arxiv report, journal submission in progress, 2019
Publisher: arxiv

Tropical Carathéodory with Matroids

Author(s): Georg Loho and Raman Sanyal
Published in: arxiv report, journal submission in progress, 2019
Publisher: arxiv

A Strongly Polynomial Label-Correcting Algorithm for Linear Systems with Two Variables per Inequality

Author(s): Zhuan Khye Koh, Bento Natura, László A. Végh
Published in: arxiv report, submission in progress, 2020
Publisher: arxiv

Oriented Matroids from Triangulations of Products of Simplices

Author(s): Marcel Celaya, Georg Loho, Chi Ho Yuen
Published in: arxiv report, submission in progress, 2020
Publisher: arxiv

Selecting a Match: Exploration vs Decision

Author(s): Agarwal, Ishan; Cole, Richard; Tao, Yixin
Published in: manuscript, submission in progress, 1, 2021
Publisher: arxiv
DOI: 10.48550/arxiv.2106.08033

Training Fully Connected Neural Networks is ∃ℝ-Complete

Author(s): Bertschinger, Daniel; Hertrich, Christoph; Jungeblut, Paul; Miltzow, Tillmann; Weber, Simon
Published in: arxiv report, submission in progress, 2022
Publisher: arxiv
DOI: 10.48550/arxiv.2204.01368

Circuit imbalance measures and linear programming

Author(s): Ekbatani, Farbod; Natura, Bento; Végh, László A.
Published in: Surveys in Combinatorics 2022, 8, 2022
Publisher: Cambridge University Press
DOI: 10.1017/9781009093927.004