A new method for solving Pareto eigenvalue complementarity problems

作者：Adly Samir^*; Rammal Hadia

来源：Computational Optimization and Applications, 2013, 55(3): 703-731.

DOI：10.1007/s10589-013-9534-y

• Complementarity problems
• One-constrained eigenvalue problems
• Complementarity functions
• Semismooth Newton Method
• Lattice Projection Method
• Bi-eigenvalue complementarity problems

In this paper, we introduce a new method, called the Lattice Projection Method (LPM), for solving eigenvalue complementarity problems. The original problem is reformulated to find the roots of a nonsmooth function. A semismooth Newton type method is then applied to approximate the eigenvalues and eigenvectors of the complementarity problems. The LPM is compared to SNMmin and SNMFB, two methods widely discussed in the literature for solving nonlinear complementarity problems, by using the performance profiles as a comparing tool (Dolan, Mor, in Math. Program. 91:201-213, 2002). The performance measures, used to analyze the three solvers on a set of matrices mostly taken from the Matrix Market (Boisvert et al. in The quality of numerical software: assessment and enhancement, pp. 125-137, 1997), are computing time, number of iterations, number of failures and maximum number of solutions found by each solver. The numerical experiments highlight the efficiency of the LPM and show that it is a promising method for solving eigenvalue complementarity problems. Finally, Pareto bi-eigenvalue complementarity problems were solved numerically as an application to confirm the efficiency of our method.

• 出版日期2013-7