Imagen de Portada

H-invariance theory: A complete characterization of minimax optimal fixed-point algorithms

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Yoon, TaeHo, Ryu, Ernest K., Grimmer, Benjamin
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Accelerated Minimax Algorithms Flock Together
por: Yoon, TaeHo, et al.
Publicado: (2022)

A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms
por: Yoon, TaeHo, et al.
Publicado: (2026)

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

Multiplayer Federated Learning: Reaching Equilibrium with Less Communication
por: Yoon, TaeHo, et al.
Publicado: (2025)

Nesterov Flow May Travel Infinitely Long to Converge to a Minimizer
por: Ryu, Ernest K.
Publicado: (2026)

Uniqueness of DRS as the 2 Operator Resolvent-Splitting and Impossibility of 3 Operator Resolvent-Splitting
por: Ryu, Ernest K.
Publicado: (2018)

Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms
por: Martin, Andrea, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

Optimal Non-Asymptotic Rates of Value Iteration for Average-Reward Markov Decision Processes
por: Lee, Jongmin, et al.
Publicado: (2025)

Point Convergence of Nesterov's Accelerated Gradient Method: An AI-Assisted Proof
por: Jang, Uijeong, et al.
Publicado: (2025)

Optimal First-Order Algorithms as a Function of Inequalities
por: Park, Chanwoo, et al.
Publicado: (2021)

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

Provably Faster Gradient Descent via Long Steps
por: Grimmer, Benjamin
Publicado: (2023)

A minimax optimal control approach for robust neural ODEs
por: Cipriani, Cristina, et al.
Publicado: (2023)

Distributed fixed-point algorithms for dynamic convex optimization over decentralized and unbalanced wireless networks
por: Agrawal, Navneet, et al.
Publicado: (2024)

A smoothing Anderson acceleration algorithm for nonsmooth fixed point problem with linear convergence
por: Li, Zekai, et al.
Publicado: (2024)

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

Beyond Minimax Optimality: A Subgame Perfect Gradient Method
por: Grimmer, Benjamin, et al.
Publicado: (2024)

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

Nesterov Acceleration with Operator Decomposition
por: Lee, Jaewook, et al.
Publicado: (2026)

Convergence Analyses of Davis-Yin Splitting via Scaled Relative Graphs
por: Lee, Jongmin, et al.
Publicado: (2022)

Coordinate-Update Algorithms can Efficiently Detect Infeasible Optimization Problems
por: Paeng, Jinhee, et al.
Publicado: (2023)

Policy Gradient Algorithms in Average-Reward Multichain MDPs
por: Lee, Jongmin, et al.
Publicado: (2026)

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

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

Worst-case generation via minimax optimization in Wasserstein space
por: Cheng, Xiuyuan, et al.
Publicado: (2025)

ALiA: Adaptive Linearized ADMM
por: Jang, Uijeong, et al.
Publicado: (2026)

Computer-Assisted Design of Accelerated Composite Optimization Methods: OptISTA
por: Jang, Uijeong, et al.
Publicado: (2023)

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

On a fixed-point continuation method for a convex optimization problem
por: Fest, Jean-Baptiste, et al.
Publicado: (2022)