AGDA+: Proximal Alternating Gradient Descent Ascent Method with a Nonmonotone Adaptive Step-Size Search for Nonconvex Minimax Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Xuan, Xu, Qiushui, Aybat, Necdet Serhat
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Stochastic GDA Method With Backtracking For Solving Nonconvex Concave Minimax Problems
by: Aybat, Necdet Serhat, et al.
Published: (2024)

SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problems
by: Zhang, Xuan, et al.
Published: (2022)

An Accelerated Primal Dual Algorithm with Backtracking for Decentralized Constrained Optimization
by: Xu, Qiushui, et al.
Published: (2025)

A Retraction-free Method for Nonsmooth Minimax Optimization over a Compact Manifold
by: Aybat, Necdet Serhat, et al.
Published: (2025)

Jointly Improving the Sample and Communication Complexities in Decentralized Stochastic Minimax Optimization
by: Zhang, Xuan, et al.
Published: (2023)

Robust Accelerated Primal-Dual Methods for Computing Saddle Points
by: Zhang, Xuan, et al.
Published: (2021)

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
by: Lin, Tianyi, et al.
Published: (2019)

Accelerated Gradient Methods with Biased Gradient Estimates: Risk Sensitivity, High-Probability Guarantees, and Large Deviation Bounds
by: Gürbüzbalaban, Mert, et al.
Published: (2025)

A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems
by: Anh, Nguyen Duc, et al.
Published: (2025)

A Randomized Block-Coordinate Primal-Dual Method for Large-scale Stochastic Saddle Point Problems
by: Hamedani, Erfan Yazdandoost, et al.
Published: (2019)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)

A Riemannian Alternating Descent Ascent Algorithmic Framework for Nonconvex-Linear Minimax Problems on Riemannian Manifolds
by: Xu, Meng, et al.
Published: (2024)

A Homogeneous Second-Order Descent Ascent Algorithm for Nonconvex-Strongly Concave Minimax Problems
by: Chen, Jia-Hao, et al.
Published: (2026)

Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
by: Lin, Tianyi, et al.
Published: (2024)

Adaptive Algorithms for Robust Phase Retrieval
by: Zheng, Zhong, et al.
Published: (2024)

Shuffling Gradient Descent-Ascent with Variance Reduction for Nonconvex-Strongly Concave Smooth Minimax Problems
by: Jiang, Xia, et al.
Published: (2024)

High-probability complexity guarantees for nonconvex minimax problems
by: Laguel, Yassine, et al.
Published: (2024)

Decentralized Stochastic Gradient Descent Ascent for Finite-Sum Minimax Problems
by: Gao, Hongchang
Published: (2022)

Adaptive Stochastic Gradient Descent Ascent Algorithm for Nonconvex Minimax Problems with Decision-Dependent Distributions
by: Gao, Yan, et al.
Published: (2025)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
by: Shen, Wei, et al.
Published: (2023)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
by: Zhang, Jiawei, et al.
Published: (2020)

A Simple Adaptive Proximal Gradient Method for Nonconvex Optimization
by: Ye, Zilong, et al.
Published: (2025)

Zeroth-Order primal-dual Alternating Projection Gradient Algorithms for Nonconvex Minimax Problems with Coupled linear Constraints
by: Zhang, Huiling, et al.
Published: (2024)

A Mean-Field Analysis of Neural Stochastic Gradient Descent-Ascent for Functional Minimax Optimization
by: Zhu, Yuchen, et al.
Published: (2024)

Enhanced Adaptive Gradient Algorithms for Nonconvex-PL Minimax Optimization
by: Huang, Feihu, et al.
Published: (2023)

A Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems
by: Wang, Qingsong, et al.
Published: (2024)

Adaptive Step Sizes for Preconditioned Stochastic Gradient Descent
by: Köhne, Frederik, et al.
Published: (2023)

Derivative-free Alternating Projection Algorithms for General Nonconvex-Concave Minimax Problems
by: Xu, Zi, et al.
Published: (2021)

Relationship between Batch Size and Number of Steps Needed for Nonconvex Optimization of Stochastic Gradient Descent using Armijo Line Search
by: Tsukada, Yuki, et al.
Published: (2023)

Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization
by: Tran-Dinh, Quoc, et al.
Published: (2024)

Convergence of Nonmonotone Proximal Gradient Methods under the Kurdyka-Lojasiewicz Property without a Global Lipschitz Assumption
by: Kanzow, Christian, et al.
Published: (2024)

Line-search and Adaptive Step Sizes for Nonconvex-strongly-concave Minimax Optimization
by: Ma, Bohao, et al.
Published: (2026)

A Single-Loop Gradient Descent and Perturbed Ascent Algorithm for Nonconvex Functional Constrained Optimization
by: Lu, Songtao
Published: (2022)

A Nonmonotone Descent Method for Optimization Problems Defined by Upper-$\mathcal{C}^2 $ Functions over Submanifolds
by: Kanzow, Christian, et al.
Published: (2026)

An Adaptive Proximal Point Method for Nonsmooth and Nonconvex Optimization on Hadamard Manifolds
by: Amaral, Vitaliano S., et al.
Published: (2025)

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
by: Xu, Zeyi, et al.
Published: (2026)

Perturbed Proximal Gradient ADMM for Nonconvex Composite Optimization
by: Zhou, Yuan, et al.
Published: (2025)

Completely Parameter-Free Single-Loop Algorithms for Nonconvex-Concave Minimax Problems
by: Yang, Junnan, et al.
Published: (2024)

Analysis of Gradient Descent with Varying Step Sizes using Integral Quadratic Constraints
by: Padmanabhan, Ram, et al.
Published: (2022)

AN-SPS: Adaptive Sample Size Nonmonotone Line Search Spectral Projected Subgradient Method for Convex Constrained Optimization Problems
by: Jerinkić, Nataša Krklec, et al.
Published: (2022)