Spectral simplex method

DOI10.1007/S10107-015-0905-2MaRDI QIDQ263213zbMATHOpenAlexFDO

Authors 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

convergencealgorithmspectral radiuscyclingfinite difference equationiterative optimization methodLeontief modelnonnegative matrixpositive linear switching systemspectral simplex methodspectrum of a graph

Mathematics Subject Classification ID

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

Recommendations

• 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

Cites work

• 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?)
• 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
• 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

Cited in

(12)

• Certifying unstability of switched systems using sum of squares programming
• Computing Closest Stable Nonnegative Matrix
• A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices
• Optimizing the spectral radius
• The greedy strategy for optimizing the Perron eigenvalue
• Consensus in asynchronous multiagent systems. II: Method of joint spectral radius
• Stabilizing the Metzler matrices with applications to dynamical systems
• Maximal acyclic subgraphs and closest stable matrices
• Bounding the row sum arithmetic mean by Perron roots of row-permuted matrices
• The operator approach to entropy games
• Consensus in asynchronous multiagent systems. III: Constructive stability and stabilizability
• How to make the Perron eigenvector simple

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)