Optimizing the Spectral Radius

DOI10.1137/110850967zbMath1282.15029OpenAlexW2011346232MaRDI QIDQ2866221

Vladimir Yu. Protasov, Yu. E. Nesterov

Publication date: 13 December 2013

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110850967

zbMATH Keywords

spectral radiusnonnegative matrixdifference equationspectrum of a graphoptimization methods

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Inequalities involving eigenvalues and eigenvectors (15A42) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (12)

The greedy strategy for optimizing the Perron eigenvalue ⋮ Continuous approximation of linear impulsive systems and a new form of robust stability ⋮ Hourglass alternative and the finiteness conjecture for the spectral characteristics of sets of non-negative matrices ⋮ How to make the Perron eigenvector simple ⋮ Perron vector optimization applied to search engines ⋮ Maximal Acyclic Subgraphs and Closest Stable Matrices ⋮ Path-following gradient-based decomposition algorithms for separable convex optimization ⋮ Black-box learning of multigrid parameters ⋮ Computing Closest Stable Nonnegative Matrix ⋮ Stabilizing the Metzler matrices with applications to dynamical systems ⋮ Consensus in asynchronous multiagent systems. II: Method of joint spectral radius ⋮ Spectral simplex method

This page was built for publication: Optimizing the Spectral Radius