Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator
From MaRDI portal
(Redirected from Publication:6126596)
Recommendations
- Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization
- Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization
- A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
- 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
- A Convergent Incremental Gradient Method with a Constant Step Size
- A three-operator splitting algorithm for nonconvex sparsity regularization
- A three-operator splitting scheme and its optimization applications
- A variable smoothing algorithm for solving convex optimization problems
- Accelerating incremental gradient optimization with curvature information
- An envelope for Davis-Yin splitting and strict saddle-point avoidance
- Convergence rate of incremental gradient and incremental Newton methods
- First-order methods in optimization
- 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
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Nearly unbiased variable selection under minimax concave penalty
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- Projecting onto the Intersection of a Cone and a Sphere
- Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions
- Sparsity and Smoothness Via the Fused Lasso
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic proximal difference-of-convex algorithm with SPIDER for a class of nonconvex nonsmooth regularized problems
- Stochastic proximal methods for non-smooth non-convex constrained sparse optimization
- Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate
- 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
- Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization
Cited in
(2)
This page was built for publication: Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126596)
