Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems
From MaRDI portal
Publication:5865360
Recommendations
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- Inertial proximal incremental aggregated gradient method with linear convergence guarantees
- Global convergence rate of proximal incremental aggregated gradient methods
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Convergent Incremental Gradient Method with a Constant Step Size
- A coordinate gradient descent method for nonsmooth separable minimization
- Accelerating incremental gradient optimization with curvature information
- An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization
- An introduction to continuous optimization for imaging
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- Convex Analysis
- Error bounds in mathematical programming
- Global convergence rate of proximal incremental aggregated gradient methods
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Minimizing finite sums with the stochastic average gradient
- Model Selection and Estimation in Regression with Grouped Variables
- 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
- Optimization methods for large-scale machine learning
- Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions
- Robust Truncated Hinge Loss Support Vector Machines
- Simultaneous Regression Shrinkage, Variable Selection, and Supervised Clustering of Predictors with OSCAR
- Sparsity and Smoothness Via the Fused Lasso
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(11)- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions
- Inertial proximal incremental aggregated gradient method with linear convergence guarantees
- SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
- An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems
- Global convergence rate of proximal incremental aggregated gradient methods
- Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems
- Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization
This page was built for publication: Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865360)
