Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization
From MaRDI portal
Recommendations
- Variable smoothing for weakly convex composite functions
- Stochastic proximal difference-of-convex algorithm with SPIDER for a class of nonconvex nonsmooth regularized problems
- Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization
- Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems
- Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems
Cites work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- A Convergent Incremental Gradient Method with a Constant Step Size
- Accelerating incremental gradient optimization with curvature information
- Convergence rate of incremental gradient and incremental Newton methods
- Global convergence rate of proximal incremental aggregated gradient methods
- Incremental subgradient methods for nondifferentiable optimization
- Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems
- Nearly unbiased variable selection under minimax concave penalty
- Nonconvex Sparse Logistic Regression With Weakly Convex Regularization
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- Robust Truncated Hinge Loss Support Vector Machines
- Stochastic model-based minimization of weakly convex functions
- Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate
- The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variable smoothing for convex optimization problems using stochastic gradients
- Variable smoothing for weakly convex composite functions
- Variational Analysis
Cited in
(5)- Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator
- An aggressive reduction on the complexity of optimization for non-strongly convex objectives
- Variable smoothing for weakly convex composite functions
- Stochastic proximal difference-of-convex algorithm with SPIDER for a class of nonconvex nonsmooth regularized problems
- Inertial proximal incremental aggregated gradient method with linear convergence guarantees
This page was built for publication: Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2047203)
