Cover Image

A Stochastic GDA Method With Backtracking For Solving Nonconvex Concave Minimax Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aybat, Necdet Serhat, Xu, Qiushui, Zhang, Xuan, Gürbüzbalaban, Mert
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

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)

AGDA+: Proximal Alternating Gradient Descent Ascent Method with a Nonmonotone Adaptive Step-Size Search for Nonconvex Minimax Problems
by: Zhang, Xuan, et al.
Published: (2024)

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

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)

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

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

A Retraction-free Method for Nonsmooth Minimax Optimization over a Compact Manifold
by: Aybat, Necdet Serhat, 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)

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

Efficient Single-Loop Stochastic Algorithms for Nonconvex-Concave Minimax Optimization
by: Jiang, Xia, et al.
Published: (2025)

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

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

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

An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization
by: Chen, Lesi, et al.
Published: (2022)

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

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

Nonsmooth Nonconvex-Concave Minimax Optimization: Convergence Criteria and Algorithms
by: Shi, Jinyang, et al.
Published: (2026)

Smoothing Meets Perturbation: Unified and Tight Analysis for Nonconvex-Concave Minimax Optimization
by: Li, Jiajin, et al.
Published: (2026)

Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems
by: Wang, Jun-Lin, et al.
Published: (2024)

Stochastic Approximation Proximal Subgradient Method for Stochastic Convex-Concave Minimax Optimization
by: Dai, Yu-Hong, 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)

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

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
by: Ding, Kuangyu, et al.
Published: (2024)

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)

Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima
by: Dixit, Rishabh, et al.
Published: (2023)

Minimax Theorems for Possibly Nonconvex Functions
by: Thieu, Nguyen Nang, 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 Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems
by: Wang, Qingsong, et al.
Published: (2024)

An Efficient Stochastic First-Order Algorithm for Nonconvex-Strongly Concave Minimax Optimization beyond Lipschitz Smoothness
by: Gao, Yan, et al.
Published: (2026)

Solving Minimax Problems with Bilinear Objectives with ADMM
by: Wilson, Bob
Published: (2026)

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

A Scenario Approach to the Robustness of Nonconvex-Nonconcave Minimax Problems
by: Peng, Huan, 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)

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

Trust Region Methods For Nonconvex Stochastic Optimization Beyond Lipschitz Smoothness
by: Xie, Chenghan, et al.
Published: (2023)

A Stochastic Implicit Proximal Point Algorithm for Solving Linearly Constrained Stochastic Minimax Problems
by: Zhu, Kehan, et al.
Published: (2026)

Generalized EXTRA stochastic gradient Langevin dynamics
by: Gurbuzbalaban, Mert, et al.
Published: (2024)

RESIST: Resilient Decentralized Learning Using Consensus Gradient Descent
by: Fang, Cheng, et al.
Published: (2025)

Accelerated Proximal Gradient Method with Backtracking for Multiobjective Optimization
by: Huang, Chengzhi, et al.
Published: (2024)