Name
Abstract | ||
|---|---|---|
In this paper, we study structured quasi-Newton methods for optimization problems with orthogonality constraints. Note that the Riemannian Hessian of the objective function requires both the Euclidean Hessian and the Euclidean gradient. In particular, we are interested in applications that the Euclidean Hessian itself consists of a computational cheap part and a significantly expensive part. Our basic idea is to keep these parts of lower computational costs but substitute those parts of higher computational costs by the limited-memory quasi-Newton update. More specifically, the part related to the Euclidean gradient and the cheaper parts in the Euclidean Hessian are preserved. The initial quasi-Newton matrix is further constructed from a limited-memory Nystrom approximation to the expensive part. Consequently, our subproblems approximate the original objective function in the Euclidean space and preserve the orthogonality constraints without performing the so-called vector transports. When the subproblems are solved to sufficient accuracy, both global and local q-superlinear convergence can be established under mild conditions. Preliminary numerical experiments on the linear eigenvalue problem and the electronic structure calculation show the effectiveness of our method compared with the state-of-art algorithms. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1137/18M121112X | SIAM JOURNAL ON SCIENTIFIC COMPUTING |
Keywords | Field | DocType |
optimization with orthogonality constraints,structured quasi-Newton method,limited-memory Nystrom approximation,Hartree-Fock total energy minimization | Convergence (routing),Mathematical optimization,Matrix (mathematics),Hessian matrix,Orthogonality,Euclidean space,Euclidean geometry,Optimization problem,Mathematics,Eigenvalues and eigenvectors | Journal |
Volume | Issue | ISSN |
41 | 4 | 1064-8275 |
Citations | PageRank | References |
2 | 0.37 | 0 |
Authors | ||
5 | ||