String-averaging incremental stochastic subgradient algorithms
From MaRDI portal
Recommendations
- Incremental stochastic subgradient algorithms for convex optimization
- Random algorithms for convex minimization problems
- String-averaging projected subgradient methods for constrained minimization
- Distributed stochastic subgradient projection algorithms for convex optimization
- An optimal randomized incremental gradient method
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 2221957 (Why is no real title available?)
- A Convergent Incremental Gradient Method with a Constant Step Size
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A New Class of Incremental Gradient Methods for Least Squares Problems
- A Stochastic Approximation Method
- A class of globally convergent optimization methods based on conservative convex separable approximations
- A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space
- A generalized forward-backward splitting
- A method of aggregate stochastic subgradients with on-line stepsize rules for convex stochastic programming problems
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- Averaging strings of sequential iterations for convex feasibility problems.
- Benchmarking optimization software with performance profiles.
- Convergence Rates in Forward--Backward Splitting
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
- Decomposition into functions in the minimization problem
- Distributed stochastic subgradient projection algorithms for convex optimization
- Error stability properties of generalized gradient-type algorithms
- Extragradient Method with Variance Reduction for Stochastic Variational Inequalities
- Gradient Convergence in Gradient methods with Errors
- Incremental constraint projection methods for variational inequalities
- Incremental gradient algorithms with stepsizes bounded away from zero
- Incremental stochastic subgradient algorithms for convex optimization
- Incremental subgradient methods for nondifferentiable optimization
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- Inexact-restoration algorithm for constrained optimization
- Introductory lectures on convex optimization. A basic course.
- Iterative methods for fixed point problems in Hilbert spaces
- Minimization of unsmooth functionals
- Nondifferentiable optimization. Transl. from the Russian by Tetsushi Sasagawa
- OSGA: a fast subgradient algorithm with optimal complexity
- On stochastic gradient and subgradient methods with adaptive steplength sequences
- On stochastic subgradient mirror-descent algorithm with weighted averaging
- On the string averaging method for sparse common fixed-point problems
- Primal-dual subgradient methods for convex problems
- Proximal splitting methods in signal processing
- Random algorithms for convex minimization problems
- Robust Stochastic Approximation Approach to Stochastic Programming
- Smooth minimization of non-smooth functions
- Stochastic approximations and perturbations in forward-backward splitting for monotone operators
- Stochastic first-order methods with random constraint projection
- Stochastic optimization problems with nondifferentiable cost functionals
- String-averaging expectation-maximization for maximum likelihood estimation in emission tomography
- String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images
- String-averaging projected subgradient methods for constrained minimization
- The Existence of Probability Measures with Given Marginals
- To be fair or efficient or a bit of both
- stochastic quasigradient methods and their application to system optimization†
Cited in
(4)- General perturbation resilient dynamic string-averaging for inconsistent problems with superiorization
- Random algorithms for convex minimization problems
- String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images
- On stochastic subgradient mirror-descent algorithm with weighted averaging
This page was built for publication: String-averaging incremental stochastic subgradient algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4631774)
