A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems (Q6110456): Difference between revisions

Latest revision as of 18:33, 30 December 2024

scientific article; zbMATH DE number 7720817

Language	Label	Description	Also known as
English	A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems	scientific article; zbMATH DE number 7720817

Statements

instance of

scholarly article

0 references

title

A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems (English)

0 references

published in

Mathematical Programming. Series A. Series B

0 references

publication date

1 August 2023

0 references

full work available at URL

https://arxiv.org/abs/2006.02032

0 references

zbMATH Keywords

minimax optimization problem

0 references

alternating gradient projection algorithm

0 references

iteration complexity

0 references

single-loop algorithm

0 references

machine learning

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q4821526

0 references

On the ergodic convergence rates of a first-order primal-dual algorithm

0 references

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

0 references

Accelerated schemes for a class of variational inequalities

0 references

On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators

0 references

Decentralized Learning for Wireless Communications and Networking

0 references

Q4558202

0 references

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

0 references

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

0 references

First-order and stochastic optimization methods for machine learning

0 references

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

0 references

Q5381139

0 references

Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications

0 references

Distributed Sparse Linear Regression

0 references

On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean

0 references

Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems

0 references

Subgradient methods for saddle-point problems

0 references

Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Dual extrapolation and its applications to solving variational inequalities and related problems

0 references

Gradient methods for minimizing composite functions

0 references

An Accelerated Linearized Alternating Direction Method of Multipliers

0 references

Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems

0 references

Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning

0 references

The landscape of the proximal point method for nonconvex-nonconcave minimax optimization

0 references

Identifiers

zbMATH Open document ID

1522.90261

0 references

arXiv ID

2006.02032

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S10107-022-01919-Z

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6110456

@@ Property / DOI @@
-.1007/s10107-022-01919-z
@@ Property / DOI: 10.1007/s10107-022-01919-z / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S10107-022-01919-Z
@@ Property / DOI: 10.1007/S10107-022-01919-Z / rank @@
+Normal rank