On the quadratic eigenvalue complementarity problem

On the quadratic eigenvalue complementarity problem

0.00 Avg rating0 Votes
Article ID: iaor20163632
Volume: 66
Issue: 2
Start Page Number: 153
End Page Number: 171
Publication Date: Oct 2016
Journal: Journal of Global Optimization
Authors: , ,
Keywords: programming: nonlinear, matrices
Abstract:

We introduce several new results on the Quadratic Eigenvalue Complementarity Problem (QEiCP), focusing on the nonsymmetric case, i.e., without making symmetry assumptions on the matrices defining the problem. First we establish a new sufficient condition for existence of solutions of this problem, which is somewhat more manageable than previously existent ones. This condition works through the introduction of auxiliary variables which leads to the reduction of QEiCP to an Eigenvalue Complementarity Problem in higher dimension. Hence, this reduction suggests a new strategy for solving QEiCP, which is also analyzed in the paper. We also present an upper bound for the number of solutions of QEiCP and exhibit some examples of instances of QEiCP whose solution set has large cardinality, without attaining though the just mentioned upper bound. We also investigate the numerical solution of the QEiCP by exploiting a nonlinear programming and a variational inequality formulations of QEiCP. Some numerical experiments are reported and illustrate the benefits and drawbacks of using these formulations for solving the QEiCP in practice.

Reviews

Required fields are marked *. Your email address will not be published.