A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem

被引：43

作者：

Hoai An Le Thi ^{[1
]}

Moeini, Mahdi ^{[1
]}

Tao Pham Dinh ^{[2
]}

Judice, Joaquim ^{[3
,4
]}

机构：

[1] Paul Verlaine Univ Metz, Theoret & Appl Comp Sci Lab LITA, F-57045 Metz, France

[2] Natl Inst Appl Sci Rouen, Lab Modelling Optimizat & Operat Res, F-76131 Mont St Aignan, France

[3] Inst Telecomun, Coimbra, Portugal

[4] Univ Coimbra, Dept Math, Coimbra, Portugal

来源：

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS | 2012年 / 51卷 / 03期

关键词：

DC programming; DCA; Eigenvalue Complementarity Problem; ALGORITHMS;

D O I：

10.1007/s10589-010-9388-5

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we investigate a DC (Difference of Convex functions) programming technique for solving large scale Eigenvalue Complementarity Problems (EiCP) with real symmetric matrices. Three equivalent formulations of EiCP are considered. We first reformulate them as DC programs and then use DCA (DC Algorithm) for their solution. Computational results show the robustness, efficiency, and high speed of the proposed algorithms.

引用

页码：1097 / 1117

页数：21

共 46 条

[1] The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems [J].

An, LTH ;

Tao, PD .

ANNALS OF OPERATIONS RESEARCH, 2005, 133 (1-4) :23-46

[2] Large-scale molecular optimization from distance matrices by a d.c. optimization approach [J].

An, LTH ;

Tao, PD .

SIAM JOURNAL ON OPTIMIZATION, 2003, 14 (01) :77-114

[3]

[Anonymous], 1985, Matrix Analysis

[4]

[Anonymous], 1988, Linear Complementarity, Linear and Nonlinear Programming

[5]

[Anonymous], 1992, Numerical Methods for Large Eigenvalue Problems

[6]

[Anonymous], CLASSICS APPL MATH

[7]

[Anonymous], 2005, Numerical methods for general and structured eigenvalue problems

[8]

[Anonymous], 2006, Proceedings of the 23rd International Conference on Machine Learning

[9]

[Anonymous], 1993, Eigenvalues of Matrices

[10] GLOBALLY AND RAPIDLY CONVERGENT ALGORITHMS FOR SYMMETRICAL EIGENPROBLEMS [J].

AUCHMUTY, G .

SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1991, 12 (04) :690-706

← 1 2 3 4 5 →