Cover Image

High-probability complexity guarantees for nonconvex minimax problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Laguel, Yassine, Syed, Yasa, Aybat, Necdet Serhat, 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

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)

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

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

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

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

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)

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)

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

Fairness-informed Pareto Optimization : An Efficient Bilevel Framework
by: Tanji, Sofiane, et al.
Published: (2026)

A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees
by: Li, Shuyao, et al.
Published: (2023)

A variance reduced framework for (non)smooth nonconvex-nonconcave stochastic minimax problems with extended Kurdyka-Lojasiewicz property
by: Khan, Muhammad, et al.
Published: (2026)

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
by: Zhang, Huiling, et al.
Published: (2023)

Sharp recovery and landscape guarantees for the nonconvex matrix LASSO
by: McRae, Andrew D., et al.
Published: (2026)

Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees
by: Chinchilla, Raphael, et al.
Published: (2022)

Calm local optimality for couple-constrained minimax problems
by: Ma, Xiaoxiao, et al.
Published: (2025)

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)

Heavy-Tail Phenomenon in Decentralized SGD
by: Gurbuzbalaban, Mert, et al.
Published: (2022)

Two trust region type algorithms for solving nonconvex-strongly concave minimax problems
by: Yao, Tongliang, et al.
Published: (2024)

Nonmonotone higher-order Taylor approximation methods for composite problems
by: Nabou, Yassine
Published: (2025)

Scheduling chemotherapy appointments under uncertainty by considering different nursing care delivery schemes
by: Gul, Serhat
Published: (2022)

DIGing--SGLD: Decentralized and Scalable Langevin Sampling over Time--Varying Networks
by: Bajwa, Waheed U., et al.
Published: (2025)

Extended alternating structure-adapted proximal gradient algorithm for nonconvex nonsmooth problems
by: Gao, Ying, et al.
Published: (2024)

Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
by: Zeng, Liaoyuan, et al.
Published: (2021)

Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
by: Prudente, L. F., et al.
Published: (2023)

Active-set Newton-MR methods for nonconvex optimization problems with bound constraints
by: Birgin, Ernesto G., et al.
Published: (2025)

Complexity guarantees for risk-neutral generalized Nash equilibrium problems
by: Tao, Haochen, et al.
Published: (2025)

Riemannian trust-region methods for strict saddle functions with complexity guarantees
by: Goyens, Florentin, et al.
Published: (2024)

Avoiding strict saddle points of nonconvex regularized problems
by: Bai, Luwei, et al.
Published: (2024)

Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
by: Pinheiro, Maria Eduarda, et al.
Published: (2024)

On second-order weak sharp minima of general nonconvex set-constrained optimization problems
by: Ma, Xiaoxiao, et al.
Published: (2025)

A relaxed proximal point algorithm with double-inertial effects for nonconvex equilibrium problems
by: Van Tran, Nam
Published: (2025)

General Proximal Quasi-Newton Methods based on model functions for nonsmooth nonconvex problems
by: Jia, Xiaoxi
Published: (2025)

A convexity preserving nonconvex regularization for inverse problems under non-Gaussian noise
by: Yata, Wataru, et al.
Published: (2025)

Moving higher-order Taylor approximations method for smooth constrained minimization problems
by: Nabou, Yassine, et al.
Published: (2024)

Nonlinear preconditioned primal-dual method for a class of structured minimax problems
by: Zhang, Lu, et al.
Published: (2024)

Convergence guarantees for stochastic algorithms solving non-unique problems in metric spaces
by: Pischke, Nicholas, et al.
Published: (2026)

Certifying optimality in nonconvex robust PCA
by: Gong, Pinxi, et al.
Published: (2026)