Improved DC programming approaches for solving the quadratic eigenvalue complementarity problem - Université de Lorraine Accéder directement au contenu
Article Dans Une Revue Applied Mathematics and Computation Année : 2019

Improved DC programming approaches for solving the quadratic eigenvalue complementarity problem

Résumé

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 QEiCP can be represented as dc programming problem. Then we investigate different dc programming formulations of QEiCP and discuss their dc algorithms based on a well-known method – DCA. A new local dc decomposition is proposed which aims at constructing a better dc decomposition regarding to the specific feature of the target problem in some neighborhoods of the iterates. This new procedure yields faster convergence and better precision of the computed solution. Numerical results illustrate the efficiency of the new dc algorithms in practice.

Dates et versions

hal-02502112 , version 1 (08-03-2020)

Identifiants

Citer

Yi-Shuai Niu, Joaquim Judice, Hoai An Le Thi, Tao Pham Dinh. Improved DC programming approaches for solving the quadratic eigenvalue complementarity problem. Applied Mathematics and Computation, 2019, 353, pp.95-113. ⟨10.1016/j.amc.2019.02.017⟩. ⟨hal-02502112⟩
49 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More