An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems (Q6053022): Difference between revisions

Latest revision as of 08:54, 31 December 2024

scientific article; zbMATH DE number 7751615

Language	Label	Description	Also known as
English	An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems	scientific article; zbMATH DE number 7751615

Statements

instance of

scholarly article

0 references

title

An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems (English)

0 references

author

Arnesh Sujanani

0 references

Renato D. C. Monteiro

0 references

published in

Journal of Scientific Computing

0 references

publication date

17 October 2023

0 references

full work available at URL

https://arxiv.org/abs/2207.11905

0 references

zbMATH Keywords

first-order accelerated method

0 references

augmented Lagrangian method

0 references

smooth weakly convex function

0 references

linearly-constrained nonconvex composite optimization

0 references

iteration complexity

0 references

adaptive method

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A First-Order Smoothed Penalty Method for Compressed Sensing

0 references

A First-Order Augmented Lagrangian Method for Compressed Sensing

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

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 an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function

0 references

An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems

0 references

An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization 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

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

Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity

0 references

Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints

0 references

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

0 references

Identifiers

zbMATH Open document ID

1522.90142

0 references

arXiv ID

2207.11905

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S10915-023-02350-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6053022

@@ Property / DOI @@
-.1007/s10915-023-02350-y
@@ Property / DOI: 10.1007/s10915-023-02350-y / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W4386982907
@@ Property / OpenAlex ID: W4386982907 / rank @@
+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 @@
+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 @@
+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 an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function
+Normal rank
@@ Property / cites work @@
+An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
+Normal rank
@@ Property / cites work @@
+An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization 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 @@
+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 @@
+Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity
+Normal rank
@@ Property / cites work @@
+Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
+Normal rank
@@ Property / cites work @@
+A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization
+Normal rank
@@ Property / DOI @@
+.1007/S10915-023-02350-Y
@@ Property / DOI: 10.1007/S10915-023-02350-Y / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6053022