Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function (Q5883320): Difference between revisions

Latest revision as of 20:24, 31 July 2024

scientific article; zbMATH DE number 7669688

Language	Label	Description	Also known as
English	Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function	scientific article; zbMATH DE number 7669688

Statements

instance of

scholarly article

0 references

title

Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function (English)

0 references

0 references

0 references

0 references

Renato D. C. Monteiro

0 references

published in

SIAM Journal on Optimization

0 references

publication date

30 March 2023

0 references

full work available at URL

https://arxiv.org/abs/2008.00562

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

inexact proximal augmented Lagrangian method

0 references

linearly constrained smooth nonconvex composite programs

0 references

inner accelerated first-order methods

0 references

iteration complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$

0 references

A First-Order Smoothed Penalty Method for Compressed Sensing

0 references

A First-Order Augmented Lagrangian Method for Compressed Sensing

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Q3690580

0 references

An Accelerated Composite Gradient Method for Large-Scale Composite Objective Problems

0 references

Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems

0 references

Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization

0 references

Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems

0 references

An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems

0 references

Q3141900

0 references

Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis

0 references

Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs

0 references

An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems

0 references

Iteration-complexity of first-order penalty methods for convex programming

0 references

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

0 references

Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization

0 references

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

0 references

An adaptive accelerated first-order method for convex optimization

0 references

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

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization

0 references

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

0 references

Convex Analysis

0 references

Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming

0 references

A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5883320

@@ Property / cites work @@
+The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
+Normal rank
@@ Property / cites work @@
+A First-Order Smoothed Penalty Method for Compressed Sensing
+Normal rank
@@ Property / cites work @@
+A First-Order Augmented Lagrangian Method for Compressed Sensing
+Normal rank
@@ Property / cites work @@
+A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
+Normal rank
@@ Property / cites work @@
+Q3690580
@@ Property / cites work: Q3690580 / rank @@
+Normal rank
@@ Property / cites work @@
+An Accelerated Composite Gradient Method for Large-Scale Composite Objective Problems
+Normal rank
@@ Property / cites work @@
+Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems
+Normal rank
@@ Property / cites work @@
+Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
+Normal rank
@@ Property / cites work @@
+Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems
+Normal rank
@@ Property / cites work @@
+An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
+Normal rank
@@ Property / cites work @@
+Q3141900
@@ Property / cites work: Q3141900 / rank @@
+Normal rank
@@ Property / cites work @@
+Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
+Normal rank
@@ Property / cites work @@
+Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs
+Normal rank
@@ Property / cites work @@
+An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems
+Normal rank
@@ Property / cites work @@
+Iteration-complexity of first-order penalty methods for convex programming
+Normal rank
@@ Property / cites work @@
+Iteration-complexity of first-order augmented Lagrangian methods for convex programming
+Normal rank
@@ Property / cites work @@
+Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
+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 @@
+An adaptive accelerated first-order method for 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 @@
+Introductory lectures on convex optimization. A basic course.
+Normal rank
@@ Property / cites work @@
+Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
+Normal rank
@@ Property / cites work @@
+Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
+Normal rank
@@ Property / cites work @@
+Convex Analysis
@@ Property / cites work: Convex Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
+Normal rank
@@ Property / cites work @@
+A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization
+Normal rank