502 citations · 1.6k across the 27 of their papers we have counts for
25 papers
An iterative algorithm for the square-root Lasso
Patrizia Boccacci, Christine De Mol, Ignace Loris
In the framework of sparsity-enforcing regularisation for linear inverse problems, we consider the minimisation of a square-root Lasso cost function. To solve this problem we devis…
Convergence analysis of a primal-dual optimization-by-continuation algorithm
Ignace Loris, Simone Rebegoldi
We present a numerical iterative optimization algorithm for the minimization of a cost function consisting of a linear combination of three convex terms, one of which is differenti…
On a fixed-point continuation method for a convex optimization problem
Jean-Baptiste Fest, Tommi Heikkilä, Ignace Loris +4
We consider a variation of the classical proximal-gradient algorithm for the iterative minimization of a cost function consisting of a sum of two terms, one smooth and the other pr…
Primal-dual splitting scheme with backtracking for handling with epigraphic constraint and sparse analysis regularization
Laurence Denneulin, Nelly Pustelnik, Maud Langlois +2
The convergence of many proximal algorithms involving a gradient descent relies on its Lipschitz constant. To avoid computing it, backtracking rules can be used. While such a rule…
On starting and stopping criteria for nested primal-dual iterations
Jixin Chen, Ignace Loris
The importance of an adequate inner loop starting point (as opposed to a sufficient inner loop stopping rule) is discussed in the context of a numerical optimization algorithm cons…
On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
Silvia Bonettini, Ignace Loris, Federica Porta +2
We consider a variable metric linesearch based proximal gradient method for the minimization of the sum of a smooth, possibly nonconvex function plus a convex, possibly nonsmooth t…