Gábor Braun

According to our database, Gábor Braun authored at least 25 papers between 2005 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2019

Affine reductions for LPs and SDPs.

Gábor Braun, Sebastian Pokutta, Daniel Zink

Math. Program., 2019

Lazifying Conditional Gradient Algorithms.

Gábor Braun, Sebastian Pokutta, Daniel Zink

J. Mach. Learn. Res., 2019

Blended Conditonal Gradients.

Gábor Braun, Sebastian Pokutta, Dan Tu, Stephen J. Wright

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

Strong reductions for extended formulations.

Gábor Braun, Sebastian Pokutta, Aurko Roy

Math. Program., 2018

Blended Conditional Gradients: the unconditioning of conditional gradients.

Gábor Braun, Sebastian Pokutta, Dan Tu, Stephen J. Wright

CoRR, 2018

2017

Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory.

Gábor Braun, Cristóbal Guzmán, Sebastian Pokutta

IEEE Trans. Inf. Theory, 2017

The matching problem has no small symmetric SDP.

Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink

Math. Program., 2017

Information-theoretic approximations of the nonnegative rank.

Gábor Braun, Rahul Jain, Troy Lee, Sebastian Pokutta

Comput. Complex., 2017

2016

A Polyhedral Characterization of Border Bases.

Gábor Braun, Sebastian Pokutta

SIAM J. Discret. Math., 2016

Average case polyhedral complexity of the maximum stable set problem.

Gábor Braun, Samuel Fiorini, Sebastian Pokutta

Math. Program., 2016

An efficient high-probability algorithm for Linear Bandits.

Gábor Braun, Sebastian Pokutta

CoRR, 2016

Common Information and Unique Disjointness.

Gábor Braun, Sebastian Pokutta

Algorithmica, 2016

2015

The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes.

Gábor Braun, Sebastian Pokutta

IEEE Trans. Inf. Theory, 2015

Approximation Limits of Linear Programs (Beyond Hierarchies).

Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer

Math. Oper. Res., 2015

Info-Greedy Sequential Adaptive Compressed Sensing.

Gábor Braun, Sebastian Pokutta, Yao Xie

IEEE J. Sel. Top. Signal Process., 2015

An information diffusion Fano inequality.

Gábor Braun, Sebastian Pokutta

CoRR, 2015

Inapproximability of Combinatorial Problems via Small LPs and SDPs.

Gábor Braun, Sebastian Pokutta, Daniel Zink

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

The matching polytope does not admit fully-polynomial size relaxation schemes.

Gábor Braun, Sebastian Pokutta

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set.

Gábor Braun, Sebastian Pokutta

Oper. Res. Lett., 2014

LP and SDP inapproximability of combinatorial problems.

Gábor Braun, Sebastian Pokutta, Daniel Zink

CoRR, 2014

2012

An Algebraic Approach to Symmetric Extended Formulations.

Gábor Braun, Sebastian Pokutta

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

Random half-integral polytopes.

Gábor Braun, Sebastian Pokutta

Oper. Res. Lett., 2011

Breaking up Finite Automata Presentable torsion-Free Abelian Groups.

Gábor Braun, Lutz Strüngmann

Int. J. Algebra Comput., 2011

2010

Rank of random half-integral polytopes - extended abstract -.

Gábor Braun, Sebastian Pokutta

Electron. Notes Discret. Math., 2010

2005

Random Orders and Gambler's Ruin.

Andreas Blass, Gábor Braun

Electron. J. Comb., 2005