Variable smoothing for weakly convex composite functions
From MaRDI portal
Publication:2031930
DOI10.1007/s10957-020-01800-zzbMath1469.90135arXiv2003.07612OpenAlexW3129118870MaRDI QIDQ2031930
Publication date: 15 June 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.07612
Related Items (4)
Riemannian smoothing gradient type algorithms for nonsmooth optimization problem on compact Riemannian submanifold embedded in Euclidean space ⋮ Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator ⋮ Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems ⋮ Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization
Cites Work
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Nonlinear total variation based noise removal algorithms
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- A proximal method for composite minimization
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- LASSO-pattern search algorithm with application to ophthalmology and genomic data
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Statistical consistency and asymptotic normality for high-dimensional robust \(M\)-estimators
- Variable smoothing for convex optimization problems using stochastic gradients
- Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
- Efficiency of minimizing compositions of convex functions and smooth maps
- A variable smoothing algorithm for solving convex optimization problems
- A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization
- On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
- Stochastic Model-Based Minimization of Weakly Convex Functions
- Nonconvex Sparse Logistic Regression With Weakly Convex Regularization
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- The Fitting of Power Series, Meaning Polynomials, Illustrated on Band-Spectroscopic Data
- On the convergence rate of a forward-backward type primal-dual splitting algorithm for convex optimization problems
- Comments on «Wavelets in statistics: A review» by A. Antoniadis
This page was built for publication: Variable smoothing for weakly convex composite functions
