Cover Image

Beyond Minimax Optimality: A Subgame Perfect Gradient Method

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Grimmer, Benjamin, Shu, Kevin, Wang, Alex L.
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

Subgame Perfect Methods in Nonsmooth Convex Optimization
by: Grimmer, Benjamin, et al.
Published: (2025)

A Practical Adaptive Subgame Perfect Gradient Method
by: Luner, Alan, et al.
Published: (2025)

A Strengthened Conjecture on the Minimax Optimal Constant Stepsize for Gradient Descent
by: Grimmer, Benjamin, et al.
Published: (2024)

Accelerated Objective Gap and Gradient Norm Convergence for Gradient Descent via Long Steps
by: Grimmer, Benjamin, et al.
Published: (2024)

Composing Optimized Stepsize Schedules for Gradient Descent
by: Grimmer, Benjamin, et al.
Published: (2024)

Inexactly Smooth Performance Estimation and New Optimized Gradient Methods
by: Zoll, Aaron, et al.
Published: (2026)

A Universally Optimal Primal-Dual Method for Minimizing Heterogeneous Compositions
by: Zoll, Aaron, et al.
Published: (2025)

The Optimal Smoothings of Sublinear Functions and Convex Cones
by: Samakhoana, Thabo, et al.
Published: (2025)

Provably Faster Gradient Descent via Long Steps
by: Grimmer, Benjamin
Published: (2023)

Some Unified Theory for Variance Reduced Prox-Linear Methods
by: Wu, Yue, et al.
Published: (2024)

Scalable Projection-Free Optimization Methods via MultiRadial Duality Theory
by: Samakhoana, Thabo, et al.
Published: (2024)

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
by: Grimmer, Benjamin, et al.
Published: (2026)

First-Order Methods for Nonsmooth Nonconvex Functional Constrained Optimization with or without Slater Points
by: Jia, Zhichao, et al.
Published: (2022)

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization
by: Grimmer, Benjamin, et al.
Published: (2023)

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/ε)$ Overhead
by: Wu, Yue, et al.
Published: (2026)

An Elementary Proof of the Near Optimality of LogSumExp Smoothing
by: Samakhoana, Thabo, et al.
Published: (2025)

Goldstein Stationarity in Lipschitz Constrained Optimization
by: Grimmer, Benjamin, et al.
Published: (2023)

On Averaging and Extrapolation for Gradient Descent
by: Luner, Alan, et al.
Published: (2024)

A Minimax Optimal Controller for Positive Systems
by: Gurpegui, Alba, et al.
Published: (2025)

Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization
by: Tran-Dinh, Quoc, 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)

H-invariance theory: A complete characterization of minimax optimal fixed-point algorithms
by: Yoon, TaeHo, et al.
Published: (2025)

Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

Minimax Optimal Adaptive Control for Systems on Cones
by: Rantzer, Anders
Published: (2025)

An Optimistic Gradient Tracking Method for Distributed Minimax Optimization
by: Huang, Yan, et al.
Published: (2025)

Optimal Acceleration for Minimax and Fixed-Point Problems is Not Unique
by: Yoon, TaeHo, et al.
Published: (2024)

On Minimax Optimal Dual Control for Fully Actuated Systems
by: Rantzer, Anders
Published: (2025)

Doubly Smoothed Optimistic Gradients: A Universal Approach for Smooth Minimax Problems
by: Zheng, Taoli, et al.
Published: (2025)

Adaptive Single-Loop Methods for Stochastic Minimax Optimization on Riemannian Manifolds
by: Wang, Hongye, et al.
Published: (2026)

A Single-Loop Stochastic Gradient Algorithm for Minimax Optimization with Nonlinear Coupled Constraints
by: Cao, Qichao, et al.
Published: (2026)

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)

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

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

Iteratively Regularized Gradient Tracking Methods for Optimal Equilibrium Seeking
by: Qiu, Yuyang, et al.
Published: (2024)

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

Minimax Excess Risk of First-Order Methods for Statistical Learning with Data-Dependent Oracles
by: Scaman, Kevin, et al.
Published: (2023)

Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
by: Boone, Victor, 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 Mean-Field Analysis of Neural Stochastic Gradient Descent-Ascent for Functional Minimax Optimization
by: Zhu, Yuchen, et al.
Published: (2024)

La Méthode du Gradient Proximé
by: Combettes, Patrick L.
Published: (2025)