Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints
From MaRDI portal
(Redirected from Publication:5230652)
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 specically, the part related to Euclidean gradient and the cheaper parts in the Euclidean Hessian are preserved. The initial quasi-Newton matrix is further constructed from a limited-memory Nystr"om 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.
Recommendations
- scientific article; zbMATH DE number 5073
- scientific article; zbMATH DE number 782037
- Structure of quasi-Newton minimization methods
- scientific article; zbMATH DE number 3932310
- scientific article; zbMATH DE number 4205888
- scientific article; zbMATH DE number 3903875
- Improved approximation bound for quadratic optimization problems with orthogonality constraints
- LOCAL AND SUPERLINEAR CONVERGENCE OF STRUCTURED QUASI-NEWTON METHODS FOR NONLINEAR OPTIMIZATION
- Quasi-newton methods for monlinear equations and unconstrained optimization problems
Cites work
- scientific article; zbMATH DE number 681023 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Broyden class of quasi-Newton methods for Riemannian optimization
- A Riemannian BFGS method for nonconvex optimization problems
- A Riemannian BFGS method without differentiated retraction for nonconvex optimization problems
- A Riemannian symmetric rank-one trust-region method
- A Trust Region Direct Constrained Minimization Algorithm for the Kohn–Sham Equation
- A feasible method for optimization with orthogonality constraints
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Adaptive quadratically regularized Newton method for Riemannian optimization
- Adaptive regularized self-consistent field iteration with exact Hessian for electronic structure calculation
- An Extrinsic Look at the Riemannian Hessian
- Analysis of a Symmetric Rank-One Trust Region Method
- Computational chemistry from the perspective of numerical analysis
- Convergence of Adaptive Compression Methods for Hartree‐Fock‐Like Equations
- Cubic regularization of Newton method and its global performance
- Electronic Structure
- Global convergence of a new hybrid Gauss-Newton structured BFGS method for nonlinear least squares problems
- Global rates of convergence for nonconvex optimization on manifolds
- KSSOLV -- a MATLAB toolbox for solving the Kohn-Sham equations
- Limited memory block Krylov subspace optimization for computing dominant singular value decompositions
- Manopt, a Matlab toolbox for optimization on manifolds
- Minimizing a differentiable function over a differential manifold
- On the convergence of Newton iterations to non-stationary points
- Optimization Techniques on Riemannian Manifolds
- Optimization methods on Riemannian manifolds and their application to shape space
- Optimization theory and methods. Nonlinear programming
- ROPTLIB: An object-oriented C++ library for optimization on Riemannian manifolds
- Representations of quasi-Newton matrices and their use in limited memory methods
- The Geometry of Algorithms with Orthogonality Constraints
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Trust-region methods on Riemannian manifolds
Cited in
(19)- Beyond the Four-Decade DIIS Default:Auxiliary-Curvature Acceleration of Self-Consistent-Field Calculations
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- Numerical methods for Kohn–Sham density functional theory
- Accelerated gradient methods on the Grassmann and Stiefel manifolds
- A communication-efficient and privacy-aware distributed algorithm for sparse PCA
- A Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality Constraints
- An exact penalty approach for optimization with nonnegative orthogonality constraints
- A Riemannian optimization approach to clustering problems
- Geometric inexact Newton method for generalized singular values of Grassmann matrix pair
- A brief introduction to manifold optimization
- Computation over t-product based tensor Stiefel manifold: a preliminary study
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- Accelerated optimization with orthogonality constraints
- An infeasible projection-type algorithm for finding nonnegative ground state solutions of nonlinear Schrödinger equations
- Optimizing the optimizer for physics-informed neural networks and Kolmogorov-Arnold networks
- KSSOLV 2.0: an efficient Matlab toolbox for solving the Kohn-Sham equations with plane-wave basis set
- Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
- Subspace methods for nonlinear optimization
This page was built for publication: Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230652)
