An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems (Q2181594): Difference between revisions

Latest revision as of 18:11, 22 July 2024

scientific article

Language	Label	Description	Also known as
English	An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems	scientific article

Statements

instance of

scholarly article

0 references

title

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

0 references

author

Jefferson G. Melo

0 references

Renato D. C. Monteiro

0 references

WeiWei Kong

0 references

published in

Computational Optimization and Applications

0 references

publication date

19 May 2020

0 references

full work available at URL

https://arxiv.org/abs/1812.06352

0 references

zbMATH Keywords

quadratic penalty method

0 references

nonconvex program

0 references

iteration-complexity

0 references

proximal point method

0 references

first-order accelerated methods

0 references

describes a project that uses

NC-OPT

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

First-Order Methods in Optimization

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

Accelerated Methods for NonConvex Optimization

0 references

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems

0 references

Optimal Primal-Dual Methods for a Class of Saddle Point Problems

0 references

Efficiency of minimizing compositions of convex functions and smooth maps

0 references

Accelerated gradient methods for nonconvex nonlinear and stochastic programming

0 references

Generalized uniformly optimal methods for nonlinear programming

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

An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex–concave saddle-point problems

0 references

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

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

A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems

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

Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems

0 references

An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Cubic regularization of Newton method and its global performance

0 references

Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator

0 references

Proximal alternating penalty algorithms for nonsmooth constrained convex optimization

0 references

Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity

0 references

Identifiers

zbMATH Open document ID

1443.90282

0 references

DOI

10.1007/s10589-020-00188-w

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2181594

@@ Property / cites work @@
+First-Order Methods in Optimization
@@ Property / cites work: First-Order Methods in Optimization / 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 @@
+A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
+Normal rank
@@ Property / cites work @@
+Accelerated Methods for NonConvex Optimization
@@ Property / cites work: Accelerated Methods for NonConvex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
+Normal rank
@@ Property / cites work @@
+Optimal Primal-Dual Methods for a Class of Saddle Point Problems
+Normal rank
@@ Property / cites work @@
+Efficiency of minimizing compositions of convex functions and smooth maps
+Normal rank
@@ Property / cites work @@
+Accelerated gradient methods for nonconvex nonlinear and stochastic programming
+Normal rank
@@ Property / cites work @@
+Generalized uniformly optimal methods for nonlinear programming
+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 @@
+An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex–concave saddle-point problems
+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 @@
+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 @@
+A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems
+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 @@
+Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems
+Normal rank
@@ Property / cites work @@
+An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods
+Normal rank
@@ Property / cites work @@
+Introductory lectures on convex optimization. A basic course.
+Normal rank
@@ Property / cites work @@
+Cubic regularization of Newton method and its global performance
+Normal rank
@@ Property / cites work @@
+Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
+Normal rank
@@ Property / cites work @@
+Monotone Operators and the Proximal Point Algorithm
+Normal rank
@@ Property / cites work @@
+A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
+Normal rank
@@ Property / cites work @@
+Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
+Normal rank
@@ Property / cites work @@
+Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity
+Normal rank