Inertial proximal incremental aggregated gradient method with linear convergence guarantees
From MaRDI portal
Publication:2084299
Recommendations
- Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- Global convergence rate of proximal incremental aggregated gradient methods
- Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
Cites work
- A Convergent Incremental Gradient Method with a Constant Step Size
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Fast first-order methods for composite convex optimization with backtracking
- First-order methods in optimization
- From error bounds to the complexity of first-order descent methods for convex functions
- Global convergence rate of proximal incremental aggregated gradient methods
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 3187156 (Why is no real title available?)
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- Introductory lectures on convex optimization. A basic course.
- iPiasco: inertial proximal algorithm for strongly convex optimization
- Linear convergence of first order methods for non-strongly convex optimization
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- On the maximal monotonicity of subdifferential mappings
- Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems
- Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions
- Quasi-Nonexpansive Iterations on the Affine Hull of Orbits: From Mann's Mean Value Algorithm to Inertial Methods
- Some methods of speeding up the convergence of iteration methods
- Sur le problème de la division
- The Group Lasso for Logistic Regression
- Tilt stability, uniform quadratic growth, and strong metric regularity of the subdifferential
- Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization
Cited in
(8)- Accelerating incremental gradient optimization with curvature information
- Linear convergence of cyclic SAGA
- An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- Global convergence rate of proximal incremental aggregated gradient methods
- Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems
This page was built for publication: Inertial proximal incremental aggregated gradient method with linear convergence guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084299)
