Spectral simplex method
This paper considers the problems of maximization and minimization of the spectral radius for nonnegative matrices with independent row uncertainties. The author proves necessary theoretical results on on-row corrections of nonnegative matrices. The spectral simplex methods for maximizing and minimizing the spectral radius are proposed. Their non-cyclicity and finite convergence is established. Statistics of the number of iterations performed by the algorithm for randomly generated uncertainty sets are presented. The author makes further an extension to general convex non-polyhedral uncertainty sets. Applications are considered to several areas including optimizing the spectral radius of a graph, constructing a productive economy in the Leontief model, stability of positive linear switching systems, and finite difference equations with nonnegative coefficients.
- Spectral method and its application to the conjugate gradient method
- Spectral methods with sparse matrices
- Spectral methods
- Spectral element methods on simplicial meshes
- A regularized simplex method
- Spectral penalty methods
- A Spectral Bundle Method for Semidefinite Programming
- Spectral Methods for Parameterized Matrix Equations
- A maximum principle for the stability analysis of positive bilinear control systems with applications to positive linear switched systems
- Derivatives and Perturbations of Eigenvectors
- Efficient algorithms for deciding the type of growth of products of integer matrices
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 2152830 (Why is no real title available?)
- Maximal graphs and graphs with maximal spectral radius
- On an upper bound of the spectral radius of graphs
- On sets of eigenvalues of matrices with prescribed row sums and prescribed graph
- On the spectral radius of (0,1)-matrices
- Optimal Investment Selection with a Multitude of Projects
- Optimizing the spectral radius
- Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices
- Stability and Stabilizability of Switched Linear Systems: A Survey of Recent Results
- Switching in systems and control
- The maximal eigenvalue of 0-1 matrices with prescribed number of ones
- The greedy strategy for optimizing the Perron eigenvalue
- Consensus in asynchronous multiagent systems. III: Constructive stability and stabilizability
- 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
- How to make the Perron eigenvector simple
- Optimizing the spectral radius
- Certifying unstability of switched systems using sum of squares programming
- Maximal acyclic subgraphs and closest stable matrices
- Computing Closest Stable Nonnegative Matrix
- Bounding the row sum arithmetic mean by Perron roots of row-permuted matrices
- A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices
This page was built for publication: Spectral simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263213)
