Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem

Yi-Shuai Niu, Joaquim Júdice, Hoai An Le Thi and Dinh Tao Pham

Applied Mathematics and Computation, 2019, vol. 353, issue C, 95-113

Abstract: 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.

Keywords: Global optimization; Eigenvalue problem; Complementarity problem; DC programming (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319301158
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:353:y:2019:i:c:p:95-113

DOI: 10.1016/j.amc.2019.02.017

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().