6 papers · 1 filter
On the convergence rate of the boosted Difference-of-Convex Algorithm (DCA)
Hadi Abbaszadehpeivasti, Etienne de Klerk, Adrien Taylor
The difference-of-convex algorithm (DCA) is a well-established nonlinear programming technique that solves successive convex optimization problems. These sub-problems are obtained…
The AutoLyap software suite for computer-assisted Lyapunov analyses of first-order methods
Manu Upadhyaya, Shuvomoy Das Gupta, Adrien B. Taylor +2
We introduce AutoLyap, a software suite that assists with Lyapunov analyses of a wide class of first-order methods for structured optimization and inclusion problems. Lyapunov anal…
Optimized projection-free algorithms for online learning: construction and worst-case analysis
Julien Weibel, Pierre Gaillard, Wouter M. Koolen +1
This work studies and develop projection-free algorithms for online learning with linear optimization oracles (a.k.a. Frank-Wolfe) for handling the constraint set. More precisely,…
A constructive approach to strengthen algebraic descriptions of function and operator classes
Anne Rubbens, Julien M. Hendrickx, Adrien Taylor
It is well known that functions (resp. operators) satisfying a property~ on a subset cannot necessarily be extended to a function (resp. operator) satisf…
Solving generic parametric linear matrix inequalities
Simone Naldi, Mohab Safey El Din, Adrien Taylor +1
We consider linear matrix inequalities (LMIs) with the 's being symmetric matrices, with entries in a ring $\mathcal…
The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training
Fabian Schaipp, Alexander Hägele, Adrien Taylor +2
We show that learning-rate schedules for large model training behave surprisingly similar to a performance bound from non-smooth convex optimization theory. We provide a bound for…