Spectral simplex method

DOI10.1007/s10107-015-0905-2zbMath1337.65047OpenAlexW2010055081MaRDI QIDQ263213

Vladimir Yu. Protasov

Publication date: 4 April 2016

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-015-0905-2

zbMATH Keywords

algorithmconvergencespectral radiusfinite difference equationnonnegative matrixLeontief modelcyclingiterative optimization methodpositive linear switching systemspectral simplex methodspectrum of a graph

Mathematics Subject Classification ID

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

Related Items (11)

A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices ⋮ The greedy strategy for optimizing the Perron eigenvalue ⋮ How to make the Perron eigenvector simple ⋮ Bounding the row sum arithmetic mean by Perron roots of row-permuted matrices ⋮ Certifying Unstability of Switched Systems Using Sum of Squares Programming ⋮ Maximal Acyclic Subgraphs and Closest Stable Matrices ⋮ Consensus in asynchronous multiagent systems. III: Constructive stability and stabilizability ⋮ 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 ⋮ The operator approach to entropy games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On an upper bound of the spectral radius of graphs
• On the spectral radius of (0,1)-matrices
• The maximal eigenvalue of 0-1 matrices with prescribed number of ones
• Switching in systems and control
• Maximal graphs and graphs with maximal spectral radius
• On sets of eigenvalues of matrices with prescribed row sums and prescribed graph
• Efficient algorithms for deciding the type of growth of products of integer matrices
• Optimizing the Spectral Radius
• A Maximum Principle for the Stability Analysis of Positive Bilinear Control Systems with Applications to Positive Linear Switched Systems
• Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices
• Derivatives and Perturbations of Eigenvectors
• Optimal Investment Selection with a Multitude of Projects
• Stability and Stabilizability of Switched Linear Systems: A Survey of Recent Results

This page was built for publication: Spectral simplex method