A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices
type: Item
instance of: scholarly article
title: A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices
zbMATH Open document ID: 1476.65080
author: Stéphane Gaubert
author: Nikolas Stott
published in: Mathematical Control and Related Fields
publication date: 2021-01-13T00:00:00Z
full work available at URL: https://arxiv.org/abs/1805.03284
Mathematics Subject Classification ID: 65H17
Mathematics Subject Classification ID: 93C30
Mathematics Subject Classification ID: 49L20
zbMATH DE Number: 7293645
zbMATH Keywords: joint spectral radius
zbMATH Keywords: nonlinear eigenproblem
zbMATH Keywords: nonnegative matrices
zbMATH Keywords: Perron-Frobenius method
zbMATH Keywords: iterative method
zbMATH Keywords: Krasnoselskii-Mann iteration
zbMATH Keywords: risk sensitive control
zbMATH Keywords: entropy games
MaRDI profile type: Publication
OpenAlex ID: W2996476674
arXiv ID: 1805.03284
Wikidata QID: Q126412059
cites work: Joint Spectral Radius and Path-Complete Graph Lyapunov Functions
cites work: Tropical polyhedra are equivalent to mean payoff games
cites work: The operator approach to entropy games
cites work: Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information
cites work: Uniqueness of the fixed point of nonexpansive semidifferentiable maps
cites work: A Variational Formula for Risk-Sensitive Reward
cites work: Entropy Games and Matrix Multiplication Games
cites work: Q4623257
cites work: Lyapunov indicator of discrete inclusions. I
cites work: Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices
cites work: Anti-dissipative schemes for advection and application to Hamilton-Jacobi-bellmann equations
cites work: Hilbert's metric and positive contraction mappings in a Banach space
cites work: On a discrete approximation of the Hamilton-Jacobi equation of dynamic programming
cites work: An efficient algorithm for Hamilton-Jacobi equations in high dimension
cites work: On the rate of convergence of Krasnosel'skiĭ-Mann iterations and their connection with sums of Bernoullis
cites work: Two approximations of solutions of Hamilton-Jacobi equations
cites work: Nonexpansive Mappings, Asymptotic Regularity and Successive Approximations
cites work: Discrete time high-order schemes for viscosity solutions of Hamilton- Jacobi-Bellman equations
cites work: Perron-Frobenius theorem for nonnegative multilinear forms and extensions
cites work: The Perron-Frobenius theorem for homogeneous, monotone functions
cites work: A maximin characterisation of the escape rate of non-expansive mappings in metrically convex spaces
cites work: Exact computation of joint spectral characteristics of linear operators
cites work: Stability of Linear Problems: Joint Spectral Radius of Sets of Matrices
cites work: Fixed Points and Iteration of a Nonexpansive Mapping in a Banach Space
cites work: Iterative building of Barabanov norms and computation of the joint spectral radius for matrix sets
cites work: Eigenvalues for a class of homogeneous cone maps arising from max-plus operators
cites work: Mean Value Methods in Iteration
cites work: A Curse-of-Dimensionality-Free Numerical Method for Solution of Certain HJB PDEs
cites work: Convergence Rate for a Curse-of-Dimensionality-Free Method for a Class of HJB PDEs
cites work: Convexity and log convexity for the spectral radius
cites work: Hilbert’s projective metric and iterated nonlinear maps
cites work: Weak Finsler structures and the Funk weak metric
cites work: Stability of discrete-time switching systems with constrained switching sequences
cites work: Spectral simplex method
cites work: Contraction of Riccati Flows Applied to the Convergence Analysis of a Max-Plus Curse-of-Dimensionality--Free Method
DOI: 10.3934/MCRF.2020011
Recommended article: An SL/QP Algorithm for Minimizing the Spectral Abscissa of Time Delay Systems
Recommended article: Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
Recommended article: On the need for special purpose algorithms for minimax eigenvalue problems
Recommended article: The level set method for the two-sided max-plus eigenproblem
Recommended article: Large-Scale Optimization of Eigenvalues
Recommended article: A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
Recommended article: Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
Recommended article: Computing Closest Stable Nonnegative Matrix
Recommended article: Computational complexity in robust controller synthesis
Recommended article: Spectral simplex method
description: scientific article