SU\G(𝔾)/K·U

Author Description

Login to generate an author description

Ask a Question About This Mathematician

All published works (10)

Action Title Date Authors
+ PDF Ask
The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control 2025-05-03 Elias Wirth Mathieu Besançon Sebastian Pokutta
+
SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization 2025-02-06 Adam Kurpisz Aaron Potechin Elias Wirth
+ PDF Ask
Improved algorithms and novel applications of the FrankWolfe.jl library 2025-01-24 Mathieu Besançon Sébastien Designolle Jannis Halbey Deborah Hendrych Dominik Kuzinowicz Sebastian Pokutta Hannah Troppens Daniel Viladrich Herrmannsdoerfer Elias Wirth
+ PDF Ask
Accelerated affine-invariant convergence rates of the Frank–Wolfe algorithm with open-loop step-sizes 2025-01-06 Elias Wirth Javier Peña Sebastian Pokutta
+ PDF Ask
Fast Convergence of Frank-Wolfe algorithms on polytopes 2024-06-26 Elias Wirth Javier Peña Sebastian Pokutta
+ PDF Ask
Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond 2023-01-01 David MartĂ­nez-Rubio Elias Wirth Sebastian Pokutta
+ PDF Ask
Accelerated Affine-Invariant Convergence Rates of the Frank-Wolfe Algorithm with Open-Loop Step-Sizes 2023-01-01 Elias Wirth Javier Peña Sebastian Pokutta
+ PDF Ask
Acceleration of Frank-Wolfe Algorithms with Open-Loop Step-Sizes 2022-01-01 Elias Wirth Thomas Kerdreux Sebastian Pokutta
+ PDF Ask
Approximate Vanishing Ideal Computations at Scale 2022-01-01 Elias Wirth Hiroshi Kera Sebastian Pokutta
+ PDF Ask
Conditional Gradients for the Approximate Vanishing Ideal 2022-01-01 Elias Wirth Sebastian Pokutta

Common Coauthors

Coauthor Papers Together
Sebastian Pokutta 9
Javier Peña 3
Mathieu Besançon 2
Aaron Potechin 1
Hiroshi Kera 1
Daniel Viladrich Herrmannsdoerfer 1
Deborah Hendrych 1
Adam Kurpisz 1
David MartĂ­nez-Rubio 1
Jannis Halbey 1
SĂ©bastien Designolle 1
Dominik Kuzinowicz 1
Hannah Troppens 1
Thomas Kerdreux 1

Commonly Cited References

Action Title Date Authors # of times referenced
+ PDF Ask
Sparse sum-of-squares certificates on finite abelian groups 2015-12-01 Hamza Fawzi James Saunderson Pablo A. Parrilo 1
+ PDF Ask
Sums of squares on the hypercube 2016-04-21 Grigoriy Blekherman JoĂŁo Gouveia James Pfeiffer 1
+ PDF Ask
Optimal Transport for Domain Adaptation 2016-10-07 Nicolas Courty RĂ©mi Flamary Devis Tuia Alain Rakotomamonjy 1
+
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs 2001-01-01 Jean B. Lasserre 1
+ PDF Ask
On the uniform convexity of Lp and lp 1956-02-01 Olof Hanner 1
+ PDF Ask
Complexity of Semi-algebraic Proofs 2002-01-01 Dima Grigoriev Edward Hirsch Dmitrii V. áč–asechnik 1
+
An extension of the frank and Wolfe method of feasible directions 1974-12-01 Charles A. Holloway 1
+
Global Optimization with Polynomials and the Problem of Moments 2001-01-01 Jean B. Lasserre 1
+ PDF Ask
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming 1995-11-01 Michel X. Goemans David P. Williamson 1
+
Some comments on Wolfe's ‘away step’ 1986-05-01 J Guelat Patrice Marcotte 1
+ PDF Ask
Lower Bounds on the Size of Semidefinite Programming Relaxations 2015-06-03 James R. Lee Prasad Raghavendra David Steurer 1
+ PDF Ask
Sum-of-squares Lower Bounds for Planted Clique 2015-06-03 Raghu Meka Aaron Potechin Avi Wigderson 1
+
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations 1952-12-01 Herman Chernoff 1
+
Complexity Estimates for the SchmĂŒdgen Positivstellensatz 1996-06-01 Gilbert Stengle 1
+ PDF Ask
Strong duality in Lasserre’s hierarchy for polynomial optimization 2015-02-27 CĂ©dric Josz Didier Henrion 1
+ PDF Ask
Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method 2015-06-03 Boaz Barak Jonathan A. Kelner David Steurer 1
+ PDF Ask
ïżœber Polynome, die in einem gegebenen Intervalle mïżœglichst wenig von Null abweichen 1916-06-01 Wladimir N. Markoff J. Grossmann 1
+ PDF Ask
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming 2003-08-01 Monique Laurent 1
+
On the Shannon capacity of a graph 1979-01-01 LĂĄszlĂł LovĂĄsz 1
+
Complexity of Null- and Positivstellensatz proofs 2001-12-01 Dima Grigoriev Nicolai Vorobjov 1
+ PDF Ask
Some NP-complete problems in quadratic and nonlinear programming 1987-06-01 Katta G. Murty Santosh N. Kabadi 1
+ PDF Ask
Expander flows, geometric embeddings and graph partitioning 2009-04-01 Sanjeev Arora Satish Rao Umesh Vazirani 1
+
Laplacian eigenvalues and the maximum cut problem 1993-02-01 Charles Delorme S. Poljak 1
+
Infinite Number of Order Parameters for Spin-Glasses 1979-12-03 Giorgio Parisi 1
+ PDF Ask
Rounding Semidefinite Programming Hierarchies via Global Correlation 2011-10-01 Boaz Barak Prasad Raghavendra David Steurer 1
+
Computation of the Lasserre Ranks of Some Polytopes 2007-02-01 Kevin K. H. Cheung 1
+
Conditional gradient algorithms with open loop step size rules 1978-02-01 J. C. Dunn Stuart Harshbarger 1
+
Complexity bounds for primal-dual methods minimizing the model of objective function 2017-08-21 Yu. Nesterov 1
+
On the Matrix-Cut Rank of Polyhedra 2001-02-01 William J. Cook Sanjeeb Dash 1
+ PDF Ask
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? 2001-11-01 Michel X. Goemans Levent Tunçel 1
+
Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope 2003-11-01 Monique Laurent 1
+
Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions 2009-06-01 Alexander A. Sherstov 1
+ PDF Ask
Conditional gradient type methods for composite nonlinear and stochastic optimization 2018-01-24 Saeed Ghadimi 1
+ PDF Ask
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors 2016-06-10 Samuel B. Hopkins Tselil Schramm Jonathan Shi David Steurer 1
+ PDF Ask
Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations 2016-01-01 Adam Kurpisz Samuli LeppÀnen Monaldo Mastrolilli 1
+
An Elementary Proof of the Formula \Sum ∞ k = 1 1/k 2 = π 2 /6 1961-05-01 Yoshio Matsuoka 1
+ PDF Ask
The Power of Sherali--Adams Relaxations for General-Valued CSPs 2017-01-01 Johan Thapper Stanislav ĆœivnĂœ 1
+ PDF Ask
Sum of squares lower bounds for refuting any CSP 2017-06-15 Pravesh K. Kothari Ryuhei Mori Ryan O’Donnell David Witmer 1
+
Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems 2017-01-01 Shinsaku Sakaue Akiko Takeda Sunyoung Kim Naoki Ito 1
+ PDF Ask
Efficient Sparse Low-Rank Tensor Completion Using the Frank-Wolfe Algorithm 2017-02-13 Xiawei Guo Quanming Yao James T. Kwok 1
+ PDF Ask
Sum-of-squares hierarchy lower bounds for symmetric formulations 2019-05-22 Adam Kurpisz Samuli LeppÀnen Monaldo Mastrolilli 1
+ PDF Ask
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy 2015-10-07 Adam Kurpisz Samuli LeppÀnen Monaldo Mastrolilli 1
+ PDF Ask
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. 2016-01-01 Adam Kurpisz Samuli LeppÀnen Monaldo Mastrolilli 1
+ PDF Ask
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem 2016-10-01 Boaz Barak Samuel B. Hopkins Jonathan A. Kelner Pravesh K. Kothari Ankur Moitra Aaron Potechin 1
+ PDF Ask
Sherali–Adams relaxations of graph isomorphism polytopes 2014-02-24 Peter N. Malkin 1
+
Exact tensor completion with sum-of-squares 2017-06-18 Aaron Potechin David Steurer 1
+
Sum-Of-Squares Bounds via Boolean Function Analysis 2019-01-01 Adam Kurpisz 1
+ PDF Ask
Optimization of the Sherrington-Kirkpatrick Hamiltonian 2019-11-01 Andrea Montanari 1
+ PDF Ask
The condition number of a function relative to a set 2020-05-06 David H. Gutman Javier Peña 1
+ PDF Ask
Improved convergence analysis of Lasserre’s measure-based upper bounds for polynomial minimization on compact sets 2020-01-25 Lucas Slot Monique Laurent 1