scientific article; zbMATH DE number 7370632
From MaRDI portal
Publication:4999088
Michael R. Metel, Akiko Takeda
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/1905.10188
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stochastic optimizationconstrained optimizationnon-convex optimizationnon-smooth optimizationsparse optimization
Related Items (3)
Nonconvex optimization with inertial proximal stochastic variance reduction gradient ⋮ Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator ⋮ Stochastic variable metric proximal gradient with variance reduction for non-convex composite optimization
Uses Software
Cites Work
- Nearly unbiased variable selection under minimax concave penalty
- Wavelet inpainting with the \(\ell_{0}\) sparse regularization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- DC programming and DCA: thirty years of developments
- An index of loss aversion
- Multi-stock portfolio optimization under prospect theory
- Efficiency of minimizing compositions of convex functions and smooth maps
- An envelope for Davis-Yin splitting and strict saddle-point avoidance
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- Outlier Detection Using Nonconvex Penalized Regression
- Prospect Theory: An Analysis of Decision under Risk
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Projecting onto the Intersection of a Cone and a Sphere
- First-Order Methods in Optimization
- Understanding Machine Learning
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
This page was built for publication:
