Name
Abstract | ||
|---|---|---|
The state-of-the-art algorithms for solving the trust-region subproblem (TRS) are based on an iterative process, involving solutions of many linear systems, eigenvalue problems, subspace optimization, or line search steps. A relatively underappreciated fact, due to Gander, Golub, and von Matt [Linear Algebra Appl., 114 (1989), pp. 815839], is that TRSs can be solved by one generalized eigenvalue problem, with no outer iterations. In this paper we rediscover this fact and discover its great practicality, which exhibits good performance both in accuracy and efficiency. Moreover, we generalize the approach in various directions, namely by allowing for an ellipsoidal constraint, dealing with the so-called hard case, and obtaining approximate solutions efficiently when high accuracy is unnecessary. We demonstrate that the resulting algorithm is a general-purpose TRS solver, effective both for dense and large-sparse problems, including the so-called hard case. Our algorithm is easy to implement: its essence is a few lines of MATLAB code. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1137/16M1058200 | SIAM JOURNAL ON OPTIMIZATION |
Keywords | Field | DocType |
Trust-region subproblem,generalized eigenvalue problem,elliptic inner product,hard case | Linear algebra,Trust region,Mathematical optimization,Iterative and incremental development,Linear system,Line search,Divide-and-conquer eigenvalue algorithm,Solver,Eigenvalues and eigenvectors,Mathematics | Journal |
Volume | Issue | ISSN |
27 | 1 | 1052-6234 |
Citations | PageRank | References |
8 | 0.54 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Adachi | 1 | 41 | 7.53 |
| Satoru Iwata | 2 | 759 | 70.03 |
| Yuji Nakatsukasa | 3 | 97 | 17.74 |
| Akiko Takeda | 4 | 196 | 29.72 |