Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence
type: Item
instance of: scholarly article
title: Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence
zbMATH Open document ID: 1435.91029
DOI: 10.1137/1.9781611973402.64
author: Georgios Piliouras
author: Jeff S. Shamma
published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
publication date: 2019-06-20T00:00:00Z
Mathematics Subject Classification ID: 91A22
Mathematics Subject Classification ID: 91A44
Mathematics Subject Classification ID: 91A68
Mathematics Subject Classification ID: 93A14
Mathematics Subject Classification ID: 93B70
zbMATH DE Number: 7069382
zbMATH Keywords: evolutionary dynamics
zbMATH Keywords: zero-sum games
zbMATH Keywords: network extensions
zbMATH Keywords: Poincaré recurrence theory
zbMATH Keywords: decentralized systems
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1137/1.9781611973402.64
OpenAlex ID: W4256482224
Recommended article: Q4499603
Recommended article: Optimal chaos, nonlinearity and feasibility conditions
Recommended article: Convergence of chaotic iterative least fixed point computations
Recommended article: Q4221351
Recommended article: Convex computation of maximal Lyapunov exponents
Recommended article: Optimization Problems With Concentration And Oscillation Effects: Relaxation Theory And Numerical Approximation
Recommended article: On an ergodic method for a convex optimization problem over the fixed point set
Recommended article: Robust chaos in dynamic optimization models
Recommended article: Optimizing quasilinear stochastic dynamical systems with complex structure
Recommended article: Chaotic iterative methods for the linear complementarity problems
description: scientific article; zbMATH DE number 7069382