Cover Image

EXOTIC: An Exact, Optimistic, Tree-Based Algorithm for Min-Max Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Maheshwari, Chinmay, Pimpalkhare, Chinmay, Chatterjee, Debasish
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Artificial Intelligence Computer Science and Game Theory Multiagent Systems General Economics Economics 90C26, 90C47, 68Q32, 91A06, 65K05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Incentive-Compatible Vertiport Reservation in Advanced Air Mobility: An Auction-Based Approach
by: Su, Pan-Yang, et al.
Published: (2024)

A Parallelizable Approach for Characterizing NE in Zero-Sum Games After a Linear Number of Iterations of Gradient Descent
by: Kim, Taemin, et al.
Published: (2025)

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

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
by: Chiarelli, Nina, et al.
Published: (2023)

An efficient asymptotic DC method for sparse and low-rank matrix recovery
by: Ding, Mingcai, et al.
Published: (2024)

Performance Estimation of second-order optimization methods on classes of univariate functions
by: Rubbens, Anne, et al.
Published: (2025)

Stochastic Algorithms for Large-Scale Composite Optimization: the Case of Single-Shot X-FEL Imaging
by: Luke, D. Russell, et al.
Published: (2024)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
by: Zhang, Chenyu, et al.
Published: (2023)

Equity Implications of Federal-Local Cost-Sharing in Flood Buyouts: A Game-Theoretic Analysis with Heterogeneous Homeowners
by: Zhou, Yuqun
Published: (2026)

Application and issues in abstract convexity
by: Millán, Reinier Díaz, et al.
Published: (2022)

An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
by: Zhang, Na, et al.
Published: (2025)

Reinforcement-learning-based Algorithms for Optimization Problems and Applications to Inverse Problems
by: Xu, Chen, et al.
Published: (2023)

Consensus-based optimization for closed-box adversarial attacks and a connection to evolution strategies
by: Roith, Tim, et al.
Published: (2025)

Robust Optimization of Rank-Dependent Models with Uncertain Probabilities
by: Jin, Guanyu, et al.
Published: (2025)

Effectively Leveraging Momentum Terms in Stochastic Line Search Frameworks for Fast Optimization of Finite-Sum Problems
by: Lapucci, Matteo, et al.
Published: (2024)

Convergence Conditions for Stochastic Line Search Based Optimization of Over-parametrized Models
by: Lapucci, Matteo, et al.
Published: (2024)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

Stable matching as transport
by: Echenique, Federico, et al.
Published: (2024)

Line-search and Adaptive Step Sizes for Nonconvex-strongly-concave Minimax Optimization
by: Ma, Bohao, et al.
Published: (2026)

Multivariate approximation by polynomial and generalised rational functions
by: Millán, R. Díaz, et al.
Published: (2021)

Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
by: Vodeb, Jaka, et al.
Published: (2024)

Congestion and Penalization in Optimal Transport
by: Gallardo, Marcelo, et al.
Published: (2024)

Optimistic and pessimistic approaches for cooperative games
by: Atay, Ata, et al.
Published: (2024)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
by: Takahashi, Shota, et al.
Published: (2025)

The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm
by: Ye, Yuhan, et al.
Published: (2026)

A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
by: Lin, Yizun, et al.
Published: (2024)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
by: Zhou, Junpeng, et al.
Published: (2025)

Two-Stage Mechanism Design for Electric Vehicle Charging with Day-Ahead Reservations
by: Su, Pan-Yang, et al.
Published: (2025)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
by: Turan, Evren M., et al.
Published: (2023)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
by: Ouyang, Wenqing, et al.
Published: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
by: Ouyang, Wenqing
Published: (2025)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

Multilinear formulations for computing Nash equilibrium of multi-player matrix games
by: Fischer, Miriam, et al.
Published: (2022)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
by: Gfrerer, H.
Published: (2024)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
by: Dahl, Simeon vom, et al.
Published: (2026)

Randomized block proximal method with locally Lipschitz continuous gradient
by: Pérez-Aros, Pedro, et al.
Published: (2025)

Polynomial-Time Algorithms for Computing the Nucleolus: An Assessment
by: Meinhardt, Holger I.
Published: (2025)

Globally Optimal Solutions to a Class of Fractional Optimization Problems Based on Proximal Gradient Algorithm
by: Lin, Yizun, et al.
Published: (2023)

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction
by: Chiarelli, Nina, et al.
Published: (2024)