SABRINA: a stochastic subspace majorization-minimization algorithm
type: Item
instance of: scholarly article
title: SABRINA: a stochastic subspace majorization-minimization algorithm
author: E. Chouzenoux
author: Jean-Baptiste Fest
published in: Journal of Optimization Theory and Applications
publication date: 2022-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7618997
zbMATH Keywords: stochastic optimization
zbMATH Keywords: convergence analysis
zbMATH Keywords: majorization-minimization
zbMATH Keywords: subspace acceleration
zbMATH Keywords: binary logistic regression
zbMATH Keywords: image reconstruction
describes a project that uses: L-BFGS
describes a project that uses: PLCP
describes a project that uses: Adam
describes a project that uses: CGS
describes a project that uses: AdaGrad
describes a project that uses: RMSprop
describes a project that uses: LIBSVM
describes a project that uses: SQPlab
describes a project that uses: SGD-QN
MaRDI profile type: Publication
full work available at URL: s10957-022-02122-y
OpenAlex ID: W4301187094
cites work: Accelerated Line-search and Trust-region Methods
cites work: On perturbed proximal gradient algorithms
cites work: Nonlinear programming
cites work: Gradient Convergence in Gradient methods with Errors
cites work: Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
cites work: Numerical optimization. Theoretical and practical aspects. Transl. from the French
cites work: SGD-QN: careful quasi-Newton stochastic gradient descent
cites work: Large-Scale Machine Learning with Stochastic Gradient Descent
cites work: Optimization Methods for Large-Scale Machine Learning
cites work: A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
cites work: A stochastic quasi-Newton method for large-scale optimization
cites work: Enhancing sparsity by reweighted \(\ell _{1}\) minimization
cites work: A Majorize–Minimize Strategy for Subspace Optimization Applied to Image Restoration
cites work: A majorize-minimize subspace approach for \(\ell_2-\ell_0\) image regularization
cites work: A Stochastic Majorize-Minimize Subspace Algorithm for Online Penalized Least Squares Estimation
cites work: Stochastic approximations and perturbations in forward-backward splitting for monotone operators
cites work: Convergence of a stochastic approximation version of the EM algorithm
cites work: Q5396673
cites work: Q4969246
cites work: On the limited memory BFGS method for large scale optimization
cites work: Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
cites work: Majorize–Minimize Adapted Metropolis–Hastings Algorithm
cites work: Memory gradient method for the minimization of functions
cites work: Q5491447
cites work: Q4060241
cites work: A Stochastic Approximation Method
cites work: Q4773116
cites work: Generic Half-Quadratic Optimization for Image Reconstruction
cites work: Convergence of stochastic proximal gradient algorithm
cites work: Convergence of supermemory gradient method
cites work: CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
cites work: Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
cites work: Q3632189
cites work: Surrogate maximization/minimization algorithms and extensions
DOI: 10.1007/S10957-022-02122-Y
description: scientific article; zbMATH DE number 7618997