An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization (Q2062324): Difference between revisions

Latest revision as of 15:26, 27 July 2024

scientific article

Language	Label	Description	Also known as
English	An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization	scientific article

Statements

instance of

scholarly article

0 references

title

An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization (English)

0 references

zbMATH Open document ID

1476.90193

0 references

DOI

10.1007/s12532-021-00205-x

0 references

0 references

0 references

Mathematical Programming Computation

0 references

publication date

27 December 2021

0 references

full work available at URL

https://arxiv.org/abs/1909.09582

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

inexact augmented Lagrangian method

0 references

large scale optimization

0 references

randomized first-order method

0 references

explicit inner termination rule

0 references

relative smoothness condition

0 references

describes a project that uses

LIBSVM

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Katyusha: the first direct acceleration of stochastic gradient methods

0 references

Interior projection-like methods for monotone variational inequalities

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Smoothing and First Order Methods: A Unified Framework

0 references

Square-root lasso: pivotal recovery of sparse signals via conic programming

0 references

Q3690580

0 references

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

0 references

Q3654591

0 references

Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications

0 references

A first-order primal-dual algorithm for convex problems with applications to imaging

0 references

Atomic Decomposition by Basis Pursuit

0 references

Efficiency of minimizing compositions of convex functions and smooth maps

0 references

Restarting the accelerated coordinate descent method with a rough strong convexity estimate

0 references

Adaptive restart of accelerated gradient methods under local quadratic growth condition

0 references

Accelerated, Parallel, and Proximal Coordinate Descent

0 references

Efficient evaluation of scaled proximal operators

0 references

The Baillon-Haddad Theorem Revisited

0 references

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

0 references

On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent

0 references

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

0 references

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

0 references

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

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

An Accelerated Linearized Alternating Direction Method of Multipliers

0 references

Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization

0 references

Q4999081

0 references

Q4235027

0 references

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

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Suboptimal model predictive control (feasibility implies stability)

0 references

Sparsity and Smoothness Via the Fused Lasso

0 references

An adaptive primal-dual framework for nonsmooth convex minimization

0 references

A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization

0 references

Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization

0 references

Q4969143

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2062324

@@ Property / arXiv ID @@
+.09582
@@ Property / arXiv ID: 1909.09582 / rank @@
+Normal rank
@@ Property / cites work @@
+Katyusha: the first direct acceleration of stochastic gradient methods
+Normal rank
@@ Property / cites work @@
+Interior projection-like methods for monotone variational inequalities
+Normal rank
@@ Property / cites work @@
+A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
+Normal rank
@@ Property / cites work @@
+Smoothing and First Order Methods: A Unified Framework
+Normal rank
@@ Property / cites work @@
+Square-root lasso: pivotal recovery of sparse signals via conic programming
+Normal rank
@@ Property / cites work @@
+Q3690580
@@ Property / cites work: Q3690580 / rank @@
+Normal rank
@@ Property / cites work @@
+A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
+Normal rank
@@ Property / cites work @@
+Q3654591
@@ Property / cites work: Q3654591 / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
+Normal rank
@@ Property / cites work @@
+A first-order primal-dual algorithm for convex problems with applications to imaging
+Normal rank
@@ Property / cites work @@
+Atomic Decomposition by Basis Pursuit
@@ Property / cites work: Atomic Decomposition by Basis Pursuit / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of minimizing compositions of convex functions and smooth maps
+Normal rank
@@ Property / cites work @@
+Restarting the accelerated coordinate descent method with a rough strong convexity estimate
+Normal rank
@@ Property / cites work @@
+Adaptive restart of accelerated gradient methods under local quadratic growth condition
+Normal rank
@@ Property / cites work @@
+Accelerated, Parallel, and Proximal Coordinate Descent
+Normal rank
@@ Property / cites work @@
+Efficient evaluation of scaled proximal operators
@@ Property / cites work: Efficient evaluation of scaled proximal operators / rank @@
+Normal rank
@@ Property / cites work @@
+The Baillon-Haddad Theorem Revisited
@@ Property / cites work: The Baillon-Haddad Theorem Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Iteration-complexity of first-order augmented Lagrangian methods for convex programming
+Normal rank
@@ Property / cites work @@
+On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent
+Normal rank
@@ Property / cites work @@
+On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming
+Normal rank
@@ Property / cites work @@
+Relatively Smooth Convex Optimization by First-Order Methods, and Applications
+Normal rank
@@ Property / cites work @@
+Linear convergence of first order methods for non-strongly convex optimization
+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 @@
+An Accelerated Linearized Alternating Direction Method of Multipliers
+Normal rank
@@ Property / cites work @@
+Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
+Normal rank
@@ Property / cites work @@
+Q4999081
@@ Property / cites work: Q4999081 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4235027
@@ Property / cites work: Q4235027 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
+Normal rank
@@ Property / cites work @@
+Monotone Operators and the Proximal Point Algorithm
+Normal rank
@@ Property / cites work @@
+Suboptimal model predictive control (feasibility implies stability)
+Normal rank
@@ Property / cites work @@
+Sparsity and Smoothness Via the Fused Lasso
@@ Property / cites work: Sparsity and Smoothness Via the Fused Lasso / rank @@
+Normal rank
@@ Property / cites work @@
+An adaptive primal-dual framework for nonsmooth convex minimization
+Normal rank
@@ Property / cites work @@
+A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization
+Normal rank
@@ Property / cites work @@
+Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization
+Normal rank
@@ Property / cites work @@
+Q4969143
@@ Property / cites work: Q4969143 / rank @@
+Normal rank