In this paper, we study the Eigenvalue Complementarity Problem (EiCP) when its matrix A
belongs to the class S (G)={A=[aij]: aij= aji≠ 0 iff ij∈ E}, where G=(V, E) is a connected …

In this paper, a parametric algorithm is introduced for computing all eigenvalues for two
Eigenvalue Complementarity Problems discussed in the literature. The algorithm searches a …

In this paper, we address the solution of the symmetric eigenvalue complementarity problem
(EiCP) by treating an equivalent reformulation of finding a stationary point of a fractional …

We study splitting methods for solving the Eigenvalue Complementarity Problem (EiCP). We
introduce four variants, which depend on the properties (symmetry, nonsymmetry, positive …

In this paper, we discuss the solution of a Quadratic Eigenvalue Complementarity Problem
(QEiCP) by using Difference of Convex (DC) programming approaches. We first show that …

In this paper, we discuss the solution of linear and quadratic eigenvalue complementarity
problems (EiCPs) using an enumerative algorithm of the type introduced by Júdice et …

In this paper, we introduce a Sequential Partial Linearization (SPL) algorithm for finding a
solution of the symmetric Eigenvalue Complementarity Problem (EiCP). The algorithm can …

We present in this paper some results for solving the Quadratic Eigenvalue Complementarity
Problem (QEiCP) by using DC (Difference of Convex functions) programming approaches …

We introduce several new results on the Quadratic Eigenvalue Complementarity Problem
(QEiCP), focusing on the nonsymmetric case, ie, without making symmetry assumptions on …

We present a class of inexact splitting-modulus iteration methods for solving the Pareto
Eigenvalue Complementarity Problem (EiCP) when the system matrix A is an H+-matrix. Our …