SABRINA: a stochastic subspace majorization-minimization algorithm
From MaRDI portal
Publication:2095568
Recommendations
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Minimizing finite sums with the stochastic average gradient
- Inexact SARAH algorithm for stochastic optimization
- Accelerating mini-batch SARAH by step size rules
- Stochastic approximation algorithm for minimax problems
Cites work
- A majorize-minimize subspace approach for _2-_0 image regularization
- A Majorize–Minimize Strategy for Subspace Optimization Applied to Image Restoration
- A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
- A Stochastic Approximation Method
- A Stochastic Majorize-Minimize Subspace Algorithm for Online Penalized Least Squares Estimation
- A stochastic quasi-Newton method for large-scale optimization
- Accelerated line-search and trust-region methods
- Adaptive subgradient methods for online learning and stochastic optimization
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Convergence of a stochastic approximation version of the EM algorithm
- Convergence of stochastic proximal gradient algorithm
- Convergence of supermemory gradient method
- Convergence rates for the stochastic gradient descent method for non-convex objective functions
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Generic half-quadratic optimization for image reconstruction
- Gradient Convergence in Gradient methods with Errors
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Large-scale machine learning with stochastic gradient descent
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- Majorize–Minimize Adapted Metropolis–Hastings Algorithm
- Memory gradient method for the minimization of functions
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- Nonlinear programming
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On perturbed proximal gradient algorithms
- On the limited memory BFGS method for large scale optimization
- Optimization methods for large-scale machine learning
- SGD-QN: careful quasi-Newton stochastic gradient descent
- Stochastic approximations and perturbations in forward-backward splitting for monotone operators
- Subspace techniques for nonlinear optimization
- Surrogate maximization/minimization algorithms and extensions
Cited in
(5)- Block delayed Majorize-Minimize subspace algorithm for large scale image restoration *
- Stochastic variance-reduced majorization-minimization algorithms
- Sequential sample average majorization-minimization
- A stochastic use of the Kurdyka-Łojasiewicz property: investigation of optimization algorithms behaviours in a non-convex differentiable framework
- A novel sequential method for building upper and lower bounds of moments of distributions
This page was built for publication: SABRINA: a stochastic subspace majorization-minimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095568)
