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