Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions (Q4991666): Difference between revisions

Latest revision as of 21:07, 25 July 2024

scientific article; zbMATH DE number 7354632

Language	Label	Description	Also known as
English	Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions	scientific article; zbMATH DE number 7354632

Statements

instance of

scholarly article

0 references

title

Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions (English)

0 references

published in

Mathematics of Operations Research

0 references

publication date

3 June 2021

0 references

full work available at URL

https://arxiv.org/abs/1711.01136

0 references

zbMATH Keywords

incremental aggregated gradient

0 references

linear convergence

0 references

Lipschitz-like/convexity

0 references

relative smoothness

0 references

Bregman distance growth

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

0 references

On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity

0 references

First-Order Methods in Optimization

0 references

Mirror descent and nonlinear projected subgradient methods for convex optimization.

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Q3079664

0 references

Incremental proximal methods for large scale convex optimization

0 references

A Convergent Incremental Gradient Method with a Constant Step Size

0 references

From error bounds to the complexity of first-order descent methods for convex functions

0 references

First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems

0 references

Q4535734

0 references

Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions

0 references

Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods

0 references

On the Convergence Rate of Incremental Aggregated Gradient Algorithms

0 references

Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm

0 references

Splitting Algorithms for the Sum of Two Nonlinear Operators

0 references

Relatively Smooth Convex Optimization by First-Order Methods, and Applications

0 references

Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning

0 references

Linear convergence of first order methods for non-strongly convex optimization

0 references

Q3967358

0 references

Ergodic convergence to a zero of the sum of monotone operators in Hilbert space

0 references

Nonconvex proximal incremental aggregated gradient method with linear convergence

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Minimizing finite sums with the stochastic average gradient

0 references

A simplified view of first order methods for optimization

0 references

Approximation accuracy, gradient methods, and error bound for structured convex optimization

0 references

Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods

0 references

The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth

0 references

New analysis of linear convergence of gradient-type methods via unifying error bound conditions

0 references

Regularization and Variable Selection Via the Elastic Net

0 references

Identifiers

zbMATH Open document ID

1469.90108

0 references

DOI

10.1287/moor.2019.1047

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4991666

@@ Property / OpenAlex ID @@
+W3037678684
@@ Property / OpenAlex ID: W3037678684 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01136
@@ Property / arXiv ID: 1711.01136 / rank @@
+Normal rank
@@ Property / cites work @@
+A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
+Normal rank
@@ Property / cites work @@
+On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
+Normal rank
@@ Property / cites work @@
+First-Order Methods in Optimization
@@ Property / cites work: First-Order Methods in Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Mirror descent and nonlinear projected subgradient methods for convex optimization.
+Normal rank
@@ Property / cites work @@
+A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
+Normal rank
@@ Property / cites work @@
+Q3079664
@@ Property / cites work: Q3079664 / rank @@
+Normal rank
@@ Property / cites work @@
+Incremental proximal methods for large scale convex optimization
+Normal rank
@@ Property / cites work @@
+A Convergent Incremental Gradient Method with a Constant Step Size
+Normal rank
@@ Property / cites work @@
+From error bounds to the complexity of first-order descent methods for convex functions
+Normal rank
@@ Property / cites work @@
+First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
+Normal rank
@@ Property / cites work @@
+Q4535734
@@ Property / cites work: Q4535734 / rank @@
+Normal rank
@@ Property / cites work @@
+Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
+Normal rank
@@ Property / cites work @@
+Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
+Normal rank
@@ Property / cites work @@
+On the Convergence Rate of Incremental Aggregated Gradient Algorithms
+Normal rank
@@ Property / cites work @@
+Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm
+Normal rank
@@ Property / cites work @@
+Splitting Algorithms for the Sum of Two Nonlinear Operators
+Normal rank
@@ Property / cites work @@
+Relatively Smooth Convex Optimization by First-Order Methods, and Applications
+Normal rank
@@ Property / cites work @@
+Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
+Normal rank
@@ Property / cites work @@
+Linear convergence of first order methods for non-strongly convex optimization
+Normal rank
@@ Property / cites work @@
+Q3967358
@@ Property / cites work: Q3967358 / rank @@
+Normal rank
@@ Property / cites work @@
+Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
+Normal rank
@@ Property / cites work @@
+Nonconvex proximal incremental aggregated gradient method with linear convergence
+Normal rank
@@ Property / cites work @@
+Monotone Operators and the Proximal Point Algorithm
+Normal rank
@@ Property / cites work @@
+Minimizing finite sums with the stochastic average gradient
+Normal rank
@@ Property / cites work @@
+A simplified view of first order methods for optimization
+Normal rank
@@ Property / cites work @@
+Approximation accuracy, gradient methods, and error bound for structured convex optimization
+Normal rank
@@ Property / cites work @@
+Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods
+Normal rank
@@ Property / cites work @@
+The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth
+Normal rank
@@ Property / cites work @@
+New analysis of linear convergence of gradient-type methods via unifying error bound conditions
+Normal rank
@@ Property / cites work @@
+Regularization and Variable Selection Via the Elastic Net
+Normal rank