An alternate gradient method for optimization problems with orthogonality constraints

DOI10.3934/naco.2021003zbMath1476.65055OpenAlexW3127841625MaRDI QIDQ2062445

Yanmei Sun, Yakui Huang

Publication date: 27 December 2021

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2021003

zbMATH Keywords

Stiefel manifoldgradient projectionorthogonality constraintalternate gradient methodgradient reflection

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Cites Work

• A feasible method for optimization with orthogonality constraints
• A note on semidefinite programming relaxations for polynomial optimization over a single sphere
• A framework of constraint preserving update schemes for optimization on Stiefel manifold
• The trace minimization method for the symmetric generalized eigenvalue problem
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• A Procrustes problem on the Stiefel manifold
• A constrained optimization algorithm for total energy minimization in electronic structure calculations
• A SEQUENTIAL SUBSPACE PROJECTION METHOD FOR LINEAR SYMMETRIC EIGENVALUE PROBLEM
• Gradient Type Optimization Methods For Electronic Structure Calculations
• On the Convergence of the Self-Consistent Field Iteration in Kohn--Sham Density Functional Theory
• KSSOLV—a MATLAB toolbox for solving the Kohn-Sham equations
• Two-Point Step Size Gradient Methods
• The Geometry of Algorithms with Orthogonality Constraints
• Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
• A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Proximal Gradient Method for Ensemble Density Functional Theory
• A Direct Formulation for Sparse PCA Using Semidefinite Programming

This page was built for publication: An alternate gradient method for optimization problems with orthogonality constraints