activity
20032024
most citedApproximation Limits of Linear Programs (Beyond Hierarchies)

40 citations · 153 across the 24 of their papers we have counts for

collaborators

28 papers

math.OC2024

Flexible block-iterative analysis for the Frank-Wolfe algorithm

Gábor Braun, Jannis Halbey, Sebastian Pokutta +1

We prove that the block-coordinate Frank-Wolfe (BCFW) algorithm converges with state-of-the-art rates in both convex and nonconvex settings under a very mild "block-iterative" assu…

math.OC2022

Alternating Linear Minimization: Revisiting von Neumann's alternating projections

Gábor Braun, Sebastian Pokutta, Robert Weismantel

In 1933 von Neumann proved a beautiful result that one can approximate a point in the intersection of two convex sets by alternating projections, i.e., successively projecting on o…

math.OC2022★ 10 cited

Conditional Gradient Methods

Gábor Braun, Alejandro Carderera, Cyrille W. Combettes +4

The purpose of this survey is to serve both as a gentle introduction and a coherent overview of state-of-the-art Frank--Wolfe algorithms, also called conditional gradient algorithm…

math.OC2021

Dual Prices for Frank--Wolfe Algorithms

Gábor Braun, Sebastian Pokutta

In this note we observe that for constrained convex minimization problems over a polytope , dual prices for the linear program $\min_{z \in P} \nabla f(x) z…

math.GR2018

Decompositions of torsion-free abelian groups

Gabor Braun. Phill Schultz, Lutz Struengmann

It is known that every torsion-free abelian group of finite rank has a maximal completely decomposable summand that is unique up to isomorphism. We show that groups of infinite ran…

math.OC2018★ 17 cited

Blended Conditional Gradients: the unconditioning of conditional gradients

Gábor Braun, Sebastian Pokutta, Dan Tu +1

We present a blended conditional gradient approach for minimizing a smooth convex function over a polytope P, combining the Frank--Wolfe algorithm (also called conditional gradient…