![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Convergence analysis of block majorize-minimize subspace approach
We consider the minimization of a differentiable Lipschitz gradient but non necessarily convex, function F defined on \({\mathbb {R}}^N\) ...
-
Article
SABRINA: A Stochastic Subspace Majorization-Minimization Algorithm
A wide class of problems involves the minimization of a coercive and differentiable function F on \({\mathbb {R}}^N\) ...
-
Article
A random block-coordinate Douglas–Rachford splitting method with low computational complexity for binary logistic regression
In this paper, we propose a new optimization algorithm for sparse logistic regression based on a stochastic version of the Douglas–Rachford splitting method. Our algorithm performs both function and variable s...
-
Article
A block coordinate variable metric forward–backward algorithm
A number of recent works have emphasized the prominent role played by the Kurdyka-Łojasiewicz inequality for proving the convergence of iterative algorithms solving possibly nonsmooth/nonconvex optimization pr...
-
Article
Variable Metric Forward–Backward Algorithm for Minimizing the Sum of a Differentiable Function and a Convex Function
We consider the minimization of a function G defined on \({ \mathbb{R} } ^{N}\) , which is the sum of a (not necessarily...