Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions

DOI10.1016/S0024-3795(99)00004-XzbMATH Open1016.90067MaRDI QIDQ1124883FDOQ1124883

Authors: Alberto Seeger 

Publication date: 29 November 1999

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Recommendations

• Cone-constrained eigenvalue problems: Theory and algorithms
• Spectral classification of convex cones
• Spectral analysis of coupled linear complementarity problems
• Valeurs propres relatives à un cône convexe: Caractérisation et résultats de cardinalité. (On eigenvalues induced by a convex cone)
• Cone-constrained eigenvalue problems: structure of cone spectra

zbMATH Keywords

existencedifferential inclusionupper boundseigenvalue analysislinear complementaritycontinuous linear mappingPareto cone

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Ordinary differential inclusions (34A60) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Cited In (83)

• An alternating direction method of multipliers for the eigenvalue complementarity problem
• Spectral classification of convex cones
• On the quadratic eigenvalue complementarity problem over a general convex cone
• A nonsmooth algorithm for cone-constrained eigenvalue problems
• Higher-degree eigenvalue complementarity problems for tensors
• Eigenvalue analysis of constrained minimization problem for homogeneous polynomial
• Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
• Valeurs propres relatives à un cône convexe: Caractérisation et résultats de cardinalité. (On eigenvalues induced by a convex cone)
• Complementarity eigenvalue problems for nonlinear matrix pencils
• Critical angles between two convex cones. II: Special cases
• On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
• Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
• On convex cones with infinitely many critical angles
• Variational relation problems: existence of solutions and fixed points of contraction mappings
• Reconstructing a matrix from a partial sampling of Pareto eigenvalues
• On an enumerative algorithm for solving eigenvalue complementarity problems
• Complementarity problems with respect to Loewnerian cones
• Strictly semi-positive tensors and the boundedness of tensor complementarity problems
• Linear maps preserving Pareto eigenvalues
• On the cone eigenvalue complementarity problem for higher-order tensors
• On spectral maps induced by convex cones
• Some inertia theorems in Euclidean Jordan algebras
• Inverse eigenvalue problems for linear complementarity systems
• Solving the quadratic eigenvalue complementarity problem by DC programming
• On eigenvalues induced by a cone constraint.
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
• Cone-constrained rational eigenvalue problems
• A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
• Characterization of digraphs with three complementarity eigenvalues
• New results on Pareto spectra
• On the finiteness of the cone spectrum of certain linear transformations on Euclidean Jordan algebras
• On the numerical solution of the quadratic eigenvalue complementarity problem
• A DC programming approach for solving the symmetric eigenvalue complementarity problem
• Spectral analysis of coupled linear complementarity problems
• Linear maps preserving the Lorentz spectrum: the \(2 \times 2\) case
• Cone-constrained eigenvalue problems: Theory and algorithms
• Local minima of quadratic forms on convex cones
• Eigenvalues of set-valued operators in Banach spaces
• Complementarity spectrum of digraphs
• Linear maps preserving the Lorentz-cone spectrum in certain subspaces of \(M_n\)
• Copositivity and constrained fractional quadratic problems
• A new method for solving Pareto eigenvalue complementarity problems
• On the solution of the inverse eigenvalue complementarity problem
• On the computation of all eigenvalues for the eigenvalue complementarity problem
• On the quadratic eigenvalue complementarity problem
• Stability analysis of rough surfaces in adhesive normal contact
• The second-order cone eigenvalue complementarity problem
• Projected dynamical systems in a complementarity formalism
• Cone-constrained singular value problems
• Cone-constrained eigenvalue problems: structure of cone spectra
• On pairs of vectors achieving the maximal angle of a convex cone
• On the symmetric quadratic eigenvalue complementarity problem
• Equilibrium problems involving the Lorentz cone
• Solidity indices for convex cones
• Complementarity eigenvalue analysis of connected graphs
• Solving inverse cone-constrained eigenvalue problems
• On the maximal number of Pareto eigenvalues in a matrix of given order
• A note on the relation between the Fučík spectrum and Pareto eigenvalues
• A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
• Singular value problems under nonnegativity constraints
• A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
• The symmetric eigenvalue complementarity problem
• Complementary eigenvalues of graphs
• Splitting methods for the eigenvalue complementarity problem
• Pareto eigenvalue inclusion intervals for tensors
• On cardinality of complementarity spectra of connected graphs
• Vertex-removal, vertex-addition and different notions of similarity for vertices of a graph
• New results on complementarity spectra of connected graphs
• Pareto eigenvalue inclusion theorems and copositive tensors
• A unified criterion for distinguishing graphs by their spectral radius
• Localization sets for Pareto eigenvalues with applications
• The descent algorithms for solving symmetric Pareto eigenvalue complementarity problem.
• Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues
• Pareto \(Z\)-eigenvalue inclusion theorems for tensor eigenvalue complementarity problems
• Spectral radii of friendship graphs and their connected induced subgraphs
• Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order
• Complementarity eigenvalues and graph determination
• High-order copositive tensors and its applications
• Repetition of spectral radiuses among connected induced subgraphs
• A new descent method for symmetric non-monotone variational inequalities with application to eigenvalue complementarity problems
• Extremal problems involving the two largest complementarity eigenvalues of a graph
• The descent algorithm for solving the symmetric eigenvalue complementarity problem
• The semismooth and smoothing Newton methods for solving Pareto eigenvalue problem

This page was built for publication: Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124883)