Cover Image

A Randomized Block-Coordinate Primal-Dual Method for Large-scale Stochastic Saddle Point Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hamedani, Erfan Yazdandoost, Jalilzadeh, Afrooz, Aybat, Necdet Serhat
Format:	Preprint
Published:	2019
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Linear Convergence of a Unified Primal--Dual Algorithm for Convex--Concave Saddle Point Problems with Quadratic Growth
by: Melcher, Cody, et al.
Published: (2025)

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

Variance-reduction for Variational Inequality Problems with Bregman Distance Function
by: Alizadeh, Zeinab, et al.
Published: (2024)

Simultaneous Learning and Optimization via Misspecified Saddle Point Problems
by: Ahmadi, Mohammad Mahdi, et al.
Published: (2025)

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

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

Single-loop Projection-free and Projected Gradient-based Algorithms for Nonconvex-concave Saddle Point Problems with Bilevel Structure
by: Ahmadi, Mohammad Mahdi, et al.
Published: (2024)

On the Analysis of Misspecified Variational Inequalities with Nonlinear Constraints
by: Dey, Novel Kumar, et al.
Published: (2026)

Semi-infinite Nonconvex Constrained Min-Max Optimization
by: Melcher, Cody, 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)

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)

Convergence Analysis of Non-Strongly-Monotone Stochastic Quasi-Variational Inequalities
by: Alizadeh, Zeinab, et al.
Published: (2024)

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

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

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

An Inexact Conditional Gradient Method for Constrained Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2023)

On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
by: Cao, Jincheng, et al.
Published: (2025)

Sequential QCQP for Bilevel Optimization with Line Search
by: Sharifi, Sina, et al.
Published: (2025)

A Triple-Bregman Balanced Primal-Dual Algorithm for Saddle Point Problems
by: Yu, Jintao, et al.
Published: (2025)

An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
by: Cao, Jincheng, et al.
Published: (2024)

Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2025)

Accelerated Primal-Dual Proximal Gradient Splitting Methods for Convex-Concave Saddle-Point Problems
by: Luo, Hao
Published: (2024)

Distributionally Robust Nash Equilibria via Variational Inequalities
by: Alizadeh, Zeinab, et al.
Published: (2025)

Primal-dual Accelerated Mirror-Descent Method for Constrained Bilinear Saddle-Point Problems
by: Li, Weijian, et al.
Published: (2024)

A Generalized Primal-Dual Correction Method for Saddle-Point Problems with a Nonlinear Coupling Operator
by: Wang, Sai, et al.
Published: (2023)

Safe Gradient Flow for Bilevel Optimization
by: Sharifi, Sina, et al.
Published: (2025)

Riemannian Inexact Gradient Descent for Quadratic Discrimination
by: Talwar, Uday, et al.
Published: (2025)

On the Differentiability of the Primal-Dual Interior-Point Method
by: Tracy, Kevin, et al.
Published: (2024)

Proximal Point Method for Online Saddle Point Problem
by: Meng, Qing-xin, et al.
Published: (2024)

Primal-Dual Coordinate Descent for Nonconvex-Nonconcave Saddle Point Problems Under the Weak MVI Assumption
by: Walwil, Iyad, et al.
Published: (2025)

General Procedure to Provide High-Probability Guarantees for Stochastic Saddle Point Problems
by: Li, Dongyang, et al.
Published: (2024)

Primal-Dual Bundle Methods for Linear Equality-Constrained Problems
by: Zheng, Zhuoqing, et al.
Published: (2025)

Stochastic Primal-Dual Q-Learning
by: Jeong, Narim, et al.
Published: (2018)

Efficient First Order Method for Saddle Point Problems with Higher Order Smoothness
by: Wang, Nuozhou, et al.
Published: (2023)

An Augmented Lagrangian Primal-Dual Semismooth Newton Method for Multi-Block Composite Optimization
by: Deng, Zhanwang, et al.
Published: (2023)

Implicit Primal-Dual Interior-Point Methods for Quadratic Programming
by: Arrizabalaga, Jon, et al.
Published: (2026)

An Inexact Tensor-Train Primal-Dual Interior-Point Method for Semidefinite Programs
by: Kelbel, Frederik, et al.
Published: (2025)

Direct Spectral Acceleration of First-Order Methods for Saddle Point Problems with Bilinear Coupling
by: Li, Meng, et al.
Published: (2026)