A new random reshuffling method for nonsmooth nonconvex finite-sum optimization
From MaRDI portal
Cites work
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A minimization method for the sum of a convex function and a continuously differentiable function
- A nonsmooth Morse--Sard theorem for subanalytic functions
- A regularization interpretation of the proximal point method for weakly convex functions
- A Stochastic Approximation Method
- A stochastic semismooth Newton method for nonsmooth nonconvex optimization
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Clarke Subgradients of Stratifiable Functions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality
- Convergence of stochastic gradient descent schemes for Łojasiewicz-landscapes
- Convergence of stochastic proximal gradient algorithm
- Efficient online and batch learning using forward backward splitting
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Explicit bounds for the Łojasiewicz exponent in the gradient inequality for polynomials
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- From error bounds to the complexity of first-order descent methods for convex functions
- Genericity in polynomial optimization
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 7626722 (Why is no real title available?)
- scientific article; zbMATH DE number 6253925 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- iPiano: inertial proximal algorithm for nonconvex optimization
- Kurdyka-Łojasiewicz exponent via inf-projection
- Large-scale machine learning with stochastic gradient descent
- Lectures on convex optimization
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Nearly unbiased variable selection under minimax concave penalty
- Nonlinear programming
- Normal Maps Induced by Linear Transformations
- On a Stochastic Approximation Method
- On gradients of functions definable in o-minimal structures
- On perturbed proximal gradient algorithms
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Optimization methods for large-scale machine learning
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal splitting methods in signal processing
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- Regularization and Variable Selection Via the Elastic Net
- Signal Recovery by Proximal Forward-Backward Splitting
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Stochastic model-based minimization of weakly convex functions
- Stochastic proximal splitting algorithm for composite minimization
- Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization
- Stochastic subgradient method converges on tame functions
- Strong and Weak Convexity of Sets and Functions
- Sur le problème de la division
- The Elements of Statistical Learning
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Analysis
- Why random reshuffling beats stochastic gradient descent
Cited in
(1)
This page was built for publication: A new random reshuffling method for nonsmooth nonconvex finite-sum optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6887336)
