Image de couverture de livre

Uniform Value and Decidability in Ergodic Blind Stochastic Games

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chatterjee, Krishnendu, Lurie, David, Saona, Raimundo, Ziliotto, Bruno
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Computational Complexity 90C40, 49M25, 90C59, 91A68, 68W25
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
par: Ammann, Sabrina C. L., et autres
Publié: (2024)

The Güler-type acceleration for proximal gradient, linearized augmented Lagrangian and linearized alternating direction method of multipliers
par: Zhou, Bin, et autres
Publié: (2025)

Distributed Computing for Huge-Scale Aggregative Convex Programming
par: Tao, Luoyi
Publié: (2026)

Dimension-free estimators of gradients of functions with(out) non-independent variables
par: Lamboni, Matieyendou
Publié: (2025)

Bundle EXTRA for Decentralized Optimization
par: Liu, Haijuan, et autres
Publié: (2026)

Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
par: Gribling, Sander, et autres
Publié: (2025)

On the boundedness of the sequence generated by minibatch stochastic gradient descent
par: Bauschke, Heinz H., et autres
Publié: (2025)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
par: Rubbens, Anne, et autres
Publié: (2024)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
par: Bousselmi, Nizar, et autres
Publié: (2023)

DualFL: A Duality-based Federated Learning Algorithm with Communication Acceleration in the General Convex Regime
par: Park, Jongho, et autres
Publié: (2023)

Distributed Computing for Huge-Scale Linear Programming
par: Tao, Luoyi
Publié: (2024)

On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
par: Wu, Hanju, et autres
Publié: (2025)

Complexity of Geometric programming in the Turing model and application to nonnegative tensors
par: Friedland, Shmuel, et autres
Publié: (2023)

Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
par: He, Xin, et autres
Publié: (2026)

A distributed proximal splitting method with linesearch for locally Lipschitz gradients
par: Atenas, Felipe, et autres
Publié: (2024)

A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm
par: Chiarini, Alberto, et autres
Publié: (2024)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
par: Hu, Wei, et autres
Publié: (2026)

Symmetric Submodular Functions, Uncrossable Functions, and Structural Submodularity
par: Simmons, Miles, et autres
Publié: (2025)

Tractable downfall of basis pursuit in structured sparse optimization
par: Marmary, Maya V., et autres
Publié: (2025)

Connections between convex optimization algorithms and subspace correction methods
par: Jiang, Boou, et autres
Publié: (2025)

On semidefinite programming characterizations of the numerical radius and its dual norm
par: Friedland, Shmuel, et autres
Publié: (2023)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
par: Nesterov, Yurii
Publié: (2025)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
par: Ouyang, Wenqing, et autres
Publié: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
par: Ouyang, Wenqing
Publié: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
par: Zhang, Liwei, et autres
Publié: (2025)

CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
par: Condat, Laurent, et autres
Publié: (2022)

Decentralized Optimization in Networks with Arbitrary Delays
par: Ortega, Tomas, et autres
Publié: (2024)

Accelerating preconditioned ADMM via degenerate proximal point mappings
par: Sun, Defeng, et autres
Publié: (2024)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
par: Bot, Radu Ioan, et autres
Publié: (2024)

An Efficient Stochastic First-Order Algorithm for Nonconvex-Strongly Concave Minimax Optimization beyond Lipschitz Smoothness
par: Gao, Yan, et autres
Publié: (2026)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
par: Geremew, W., et autres
Publié: (2026)

Loss Minimization for Electrical Flows over Spanning Trees on Grids
par: Ito, Takehiro, et autres
Publié: (2024)

Sample-based almost-sure quasi-optimal approximation in reproducing kernel Hilbert spaces
par: Hegemann, Nando, et autres
Publié: (2024)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
par: Grobben, Kobe, et autres
Publié: (2025)

Decentralized Optimization in Time-Varying Networks with Arbitrary Delays
par: Ortega, Tomas, et autres
Publié: (2024)

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
par: Friedland, Shmuel
Publié: (2023)

Congestion and Penalization in Optimal Transport
par: Gallardo, Marcelo, et autres
Publié: (2024)

An inertial iteratively regularized extragradient method for bilevel variational inequality problems
par: Alves, M. Marques, et autres
Publié: (2025)

Analysis of Kernel Mirror Prox for Measure Optimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

A Heuristic Alternating Direction Method of Multipliers Framework for Distributed and Centralized Tree-Constrained Optimization: Applications to Hop-Constrained Spanning Tree Multicommodity Flow Design
par: Mokhtari, Yacine
Publié: (2025)