Cover Image

Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cai, Yang, Oikonomou, Argyris, Zheng, Weiqiang
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Min-Max Optimization Is Strictly Easier Than Variational Inequalities
by: Shugart, Henry, et al.
Published: (2025)

Gradient-Free Method for Heavily Constrained Nonconvex Optimization
by: Shi, Wanli, et al.
Published: (2024)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
by: Ferreira, Ricardo N., et al.
Published: (2025)

Min-Max Connected Multiway Cut
by: Tiwary, Hans Raj, et al.
Published: (2026)

Min-Max Optimization Requires Exponentially Many Queries
by: Bernasconi, Martino, et al.
Published: (2026)

Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing
by: Li, Shuyao, et al.
Published: (2024)

Constrained and Composite Sampling via Proximal Sampler
by: Dang, Thanh, et al.
Published: (2026)

Importance Sparsification for Sinkhorn Algorithm
by: Li, Mengyu, et al.
Published: (2023)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
by: Fujiwara, Hiroshi, et al.
Published: (2025)

Complexity of Classical Acceleration for $\ell_1$-Regularized PageRank
by: Fountoulakis, Kimon, et al.
Published: (2026)

Learning-Augmented Algorithms for the Bahncard Problem
by: Zhao, Hailiang, et al.
Published: (2024)

Infrequent Resolving Algorithm for Online Linear Programming
by: Li, Guokai, et al.
Published: (2024)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
by: Grigorescu, Elena, et al.
Published: (2024)

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
by: Grigorescu, Elena, et al.
Published: (2024)

Multi-LLM Query Optimization
by: Dean, Arlen, et al.
Published: (2026)

Negative Momentum for Convex-Concave Optimization
by: Shugart, Henry, et al.
Published: (2026)

Optimal Decentralized Smoothed Online Convex Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2024)

Distributionally Robust Optimization with Adversarial Data Contamination
by: Li, Shuyao, et al.
Published: (2025)

Convex Optimization with Nested Evolving Feasible Sets
by: M., Karthick Krishna, et al.
Published: (2026)

Non-Euclidean High-Order Smooth Convex Optimization
by: Contreras, Juan Pablo, et al.
Published: (2024)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
by: Tarzanagh, Davoud Ataee, et al.
Published: (2022)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
by: Jambulapati, Arun, et al.
Published: (2024)

Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective
by: Diakonikolas, Jelena, et al.
Published: (2024)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
by: Su, Yuexin, et al.
Published: (2026)

Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
by: Shah, Harsh, et al.
Published: (2025)

Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach
by: Zhang, Hongyang R., et al.
Published: (2023)

Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
by: Zhang, Yexin, et al.
Published: (2024)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)

Exploiting Low-Rank Structure in Max-K-Cut Problems
by: Stevens, Ria, et al.
Published: (2026)

Omnipredicting Single-Index Models with Multi-Index Models
by: Hu, Lunjia, et al.
Published: (2024)

Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2023)

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
by: Su, Yuexin, et al.
Published: (2025)

Gradient Testing and Estimation by Comparisons
by: Tao, Xiwen, et al.
Published: (2024)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
by: Kim, Jung-hun, et al.
Published: (2021)

Robust Learning of a Group DRO Neuron
by: Cao, Guyang, et al.
Published: (2026)

Online Linear Programming with Replenishment
by: Chen, Yuze, et al.
Published: (2026)

Learning Mixtures of Spherical Gaussians via Fourier Analysis
by: Chakraborty, Somnath, et al.
Published: (2020)

Negative Stepsizes Make Gradient-Descent-Ascent Converge
by: Shugart, Henry, et al.
Published: (2025)

Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling
by: Kook, Yunbum, et al.
Published: (2023)

Non-Stationary Online Resource Allocation: Learning from a Single Sample
by: Feng, Yiding, et al.
Published: (2026)