On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming (Q5219732): Difference between revisions

Latest revision as of 16:22, 30 December 2024

scientific article; zbMATH DE number 7179976

Language	Label	Description	Also known as
English	On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming	scientific article; zbMATH DE number 7179976

Statements

instance of

scholarly article

0 references

title

On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming (English)

0 references

0 references

0 references

0 references

Mathematics of Operations Research

0 references

publication date

12 March 2020

0 references

full work available at URL

https://arxiv.org/abs/1603.05738

0 references

zbMATH Keywords

inexact augmented Lagrangian framework

0 references

nonergodic convergence rate

0 references

composite convex programming

0 references

describes a project that uses

TVAL3

0 references

SDPNAL+

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Q3151174

0 references

Gradient Convergence in Gradient methods with Errors

0 references

First-order methods of smooth convex optimization with inexact oracle

0 references

A practical relative error criterion for augmented Lagrangians

0 references

The Split Bregman Method for L1-Regularized Problems

0 references

Conditional gradient algorithms for norm-regularized smooth convex optimization

0 references

Multiplier and gradient methods

0 references

Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming

0 references

Gradient sliding for composite optimization

0 references

Iteration-complexity of first-order augmented Lagrangian methods for convex programming

0 references

Conditional Gradient Sliding for Convex Optimization

0 references

An efficient augmented Lagrangian method with applications to total variation minimization

0 references

A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems

0 references

Error bounds and convergence analysis of feasible descent methods: A general approach

0 references

Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods

0 references

Iteration complexity analysis of dual first-order methods for conic convex programming

0 references

Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming

0 references

Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC

0 references

Q3320132

0 references

Smooth minimization of non-smooth functions

0 references

Gradient methods for minimizing composite functions

0 references

Complexity bounds for primal-dual methods minimizing the model of objective function

0 references

An Iterative Regularization Method for Total Variation-Based Image Restoration

0 references

Q5590418

0 references

The multiplier method of Hestenes and Powell applied to convex programming

0 references

Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming

0 references

Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity

0 references

Newton’s Method for Optimization Problems with Equality Constraints

0 references

SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints

0 references

Error forgetting of Bregman iteration

0 references

Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing

0 references

Analysis on a superlinearly convergent augmented Lagrangian method

0 references

Identifiers

zbMATH Open document ID

1441.90119

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1287/MOOR.2018.0939

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5219732

@@ Property / DOI @@
-.1287/moor.2018.0939
@@ Property / DOI: 10.1287/moor.2018.0939 / rank @@
-Normal rank
@@ Property / author @@
-Shi-Qian Ma
@@ Property / author: Shi-Qian Ma / rank @@
-Normal rank
@@ Property / author @@
+Shi-Qian Ma
@@ Property / author: Shi-Qian Ma / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+TVAL3
@@ Property / describes a project that uses: TVAL3 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SDPNAL+
@@ Property / describes a project that uses: SDPNAL+ / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2962956186
@@ Property / OpenAlex ID: W2962956186 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05738
@@ Property / arXiv ID: 1603.05738 / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
+Normal rank
@@ Property / cites work @@
+Q3151174
@@ Property / cites work: Q3151174 / rank @@
+Normal rank
@@ Property / cites work @@
+Gradient Convergence in Gradient methods with Errors
+Normal rank
@@ Property / cites work @@
+First-order methods of smooth convex optimization with inexact oracle
+Normal rank
@@ Property / cites work @@
+A practical relative error criterion for augmented Lagrangians
+Normal rank
@@ Property / cites work @@
+The Split Bregman Method for L1-Regularized Problems
+Normal rank
@@ Property / cites work @@
+Conditional gradient algorithms for norm-regularized smooth convex optimization
+Normal rank
@@ Property / cites work @@
+Multiplier and gradient methods
@@ Property / cites work: Multiplier and gradient methods / rank @@
+Normal rank
@@ Property / cites work @@
+Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
+Normal rank
@@ Property / cites work @@
+Gradient sliding for composite optimization
@@ Property / cites work: Gradient sliding for composite optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Iteration-complexity of first-order augmented Lagrangian methods for convex programming
+Normal rank
@@ Property / cites work @@
+Conditional Gradient Sliding for Convex Optimization
+Normal rank
@@ Property / cites work @@
+An efficient augmented Lagrangian method with applications to total variation minimization
+Normal rank
@@ Property / cites work @@
+A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
+Normal rank
@@ Property / cites work @@
+Error bounds and convergence analysis of feasible descent methods: A general approach
+Normal rank
@@ Property / cites work @@
+Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods
+Normal rank
@@ Property / cites work @@
+Iteration complexity analysis of dual first-order methods for conic convex programming
+Normal rank
@@ Property / cites work @@
+Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Inexact Gradient Augmented Lagrangian Methods:  Application to Constrained MPC
+Normal rank
@@ Property / cites work @@
+Q3320132
@@ Property / cites work: Q3320132 / rank @@
+Normal rank
@@ Property / cites work @@
+Smooth minimization of non-smooth functions
@@ Property / cites work: Smooth minimization of non-smooth functions / rank @@
+Normal rank
@@ Property / cites work @@
+Gradient methods for minimizing composite functions
+Normal rank
@@ Property / cites work @@
+Complexity bounds for primal-dual methods minimizing the model of objective function
+Normal rank
@@ Property / cites work @@
+An Iterative Regularization Method for Total Variation-Based Image Restoration
+Normal rank
@@ Property / cites work @@
+Q5590418
@@ Property / cites work: Q5590418 / rank @@
+Normal rank
@@ Property / cites work @@
+The multiplier method of Hestenes and Powell applied to convex programming
+Normal rank
@@ Property / cites work @@
+Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
+Normal rank
@@ Property / cites work @@
+Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity
+Normal rank
@@ Property / cites work @@
+Newton’s Method for Optimization Problems with Equality Constraints
+Normal rank
@@ Property / cites work @@
+SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
+Normal rank
@@ Property / cites work @@
+Error forgetting of Bregman iteration
@@ Property / cites work: Error forgetting of Bregman iteration / rank @@
+Normal rank
@@ Property / cites work @@
+Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
+Normal rank
@@ Property / cites work @@
+Analysis on a superlinearly convergent augmented Lagrangian method
+Normal rank
@@ Property / Wikidata QID @@
+Q128017101
@@ Property / Wikidata QID: Q128017101 / rank @@
+Normal rank
@@ Property / DOI @@
+.1287/MOOR.2018.0939
@@ Property / DOI: 10.1287/MOOR.2018.0939 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5219732