11 citations · 29 across the 15 of their papers we have counts for
17 papers
A Levenberg-Marquardt Method for Nonsmooth Regularized Least Squares
Aleksandr Y. Aravkin, Robert Baraldi, Dominique Orban
We develop a Levenberg-Marquardt method for minimizing the sum of a smooth nonlinear least-squar es term and a nonsmooth term . Both and $…
On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems
Na Huang, Yu-Hong Dai, Dominique Orban +1
We consider the generalized successive overrelaxation (GSOR) method for solving a class of block three-by-three saddle-point problems. Based on the necessary and sufficient conditi…
A Stochastic Proximal Method for Nonsmooth Regularized Finite Sum Optimization
Dounia Lakhmiri, Dominique Orban, Andrea Lodi
We consider the problem of training a deep neural network with nonsmooth regularization to retrieve a sparse and efficient sub-structure. Our regularizer is only assumed to be lowe…
A semi-conjugate gradient method for solving unsymmetric positive definite linear systems
Na Huang, Yu-Hong Dai, Dominique Orban +1
The conjugate gradient (CG) method is a classic Krylov subspace method for solving symmetric positive definite linear systems. We introduce an analogous semi-conjugate gradient (SC…
Computing a Sparse Projection into a Box
Dominique Orban
We describe a procedure to compute a projection of into the intersection of the so-called \emph{zero-norm} ball of radius , i.e., the set o…
Adaptive First- and Second-Order Algorithms for Large-Scale Machine Learning
Sanae Lotfi, Tiphaine Bonniot de Ruisselet, Dominique Orban +1
In this paper, we consider both first- and second-order techniques to address continuous optimization problems arising in machine learning. In the first-order case, we propose a fr…