Zobrazit v EDS

A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem.

Uloženo v:
Podrobná bibliografie
Název: A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem.
Autoři: Fukushima, Masao, Júdice, Joaquim, de Oliveira, Welington, Sessa, Valentina
Zdroj: Computational Optimization & Applications; Dec2020, Vol. 77 Issue 3, p711-728, 18p
Témata: COMPLEMENTARITY constraints (Mathematics), ALGORITHMS, EIGENVALUES, CONVEX functions, FRACTIONAL programming, QUADRATIC programming
Abstrakt: In this paper, we introduce a Sequential Partial Linearization (SPL) algorithm for finding a solution of the symmetric Eigenvalue Complementarity Problem (EiCP). The algorithm can also be used for the computation of a stationary point of a standard fractional quadratic program. A first version of the SPL algorithm employs a line search technique and possesses global convergence to a solution of the EiCP under a simple condition related to the minimum eigenvalue of one of the matrices of the problem. Furthermore, it is shown that this condition is verified for a simpler version of the SPL algorithm that does not require a line search technique. The main computational effort of the SPL algorithm is the solution of a strictly convex standard quadratic problem, which is efficiently solved by a finitely convergent block principal pivoting algorithm. Numerical results of the solution of test problems from different sources indicate that the SPL algorithm is in general efficient for the solution of the symmetric EiCP in terms of the number of iterations, accuracy of the solution and total computational effort. [ABSTRACT FROM AUTHOR]
Copyright of Computational Optimization & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáze: Complementary Index
Popis
Abstrakt:In this paper, we introduce a Sequential Partial Linearization (SPL) algorithm for finding a solution of the symmetric Eigenvalue Complementarity Problem (EiCP). The algorithm can also be used for the computation of a stationary point of a standard fractional quadratic program. A first version of the SPL algorithm employs a line search technique and possesses global convergence to a solution of the EiCP under a simple condition related to the minimum eigenvalue of one of the matrices of the problem. Furthermore, it is shown that this condition is verified for a simpler version of the SPL algorithm that does not require a line search technique. The main computational effort of the SPL algorithm is the solution of a strictly convex standard quadratic problem, which is efficiently solved by a finitely convergent block principal pivoting algorithm. Numerical results of the solution of test problems from different sources indicate that the SPL algorithm is in general efficient for the solution of the symmetric EiCP in terms of the number of iterations, accuracy of the solution and total computational effort. [ABSTRACT FROM AUTHOR]
ISSN:09266003
DOI:10.1007/s10589-020-00226-7