Global convergence analysis of sparse regular nonconvex optimization problems
From MaRDI portal
Publication:3307901
Recommendations
- Global convergence of proximal iteratively reweighted algorithm
- Sparse optimization on measures with over-parameterized gradient descent
- Convergence analyses on sparse feedforward neural networks via group lasso regularization
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Cited in
(17)- Convergence analyses on sparse feedforward neural networks via group lasso regularization
- scientific article; zbMATH DE number 7709348 (Why is no real title available?)
- Deterministic convergence analysis via smoothing group Lasso regularization and adaptive momentum for Sigma-Pi-Sigma neural network
- Joint sparse optimization: lower-order regularization method and application in cell fate conversion
- On strong basins of attractions for non-convex sparse spike estimation: upper and lower bounds
- Analysis of multi-stage convex relaxation for sparse regularization
- Stochastic proximal linear method for structured non-convex problems
- Convergence analysis of critical point regularization with non-convex regularizers
- Convergence Rates of Training Deep Neural Networks via Alternating Minimization Methods
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz _p regularized matrix minimization
- Linearly constrained nonsmooth optimization for training autoencoders
- Efficient learning with a family of nonconvex regularizers by redistributing nonconvexity
- Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods
- Make _1 regularization effective in training sparse CNN
- SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
- Sparse optimization on measures with over-parameterized gradient descent
- Convergence properties of stochastic proximal subgradient method in solving a class of composite optimization problems with cardinality regularizer
This page was built for publication: Global convergence analysis of sparse regular nonconvex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3307901)
