Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints

From MaRDI portal
Publication:5230625

DOI10.1137/18M1221679WikidataQ127679216 ScholiaQ127679216MaRDI QIDQ5230625

Xin Liu, Bin Gao, Ya-Xiang Yuan

Publication date: 28 August 2019

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.03930




Related Items

Convergent and Orthogonality Preserving Schemes for Approximating the Kohn-Sham OrbitalsAn SAV Method for Imaginary Time Gradient Flow Model in Density Functional TheoryA parallel orbital-updating based optimization method for electronic structure calculationsA class of smooth exact penalty function methods for optimization problems with orthogonality constraintsImplicit steepest descent algorithm for optimization with orthogonality constraintsAdaptive trust-region method on Riemannian manifoldStochastic Gauss-Newton algorithms for online PCAA penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifoldA communication-efficient and privacy-aware distributed algorithm for sparse PCAA Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality ConstraintsProximal quasi-Newton method for composite optimization over the Stiefel manifoldAn exact penalty approach for optimization with nonnegative orthogonality constraintsA variance-reduced stochastic gradient tracking algorithm for decentralized optimization with orthogonality constraintsAn unconditionally energy-stable and orthonormality-preserving iterative scheme for the Kohn-Sham gradient flow based modelTriangularized orthogonalization-free method for solving extreme eigenvalue problemsAn Orthogonalization-Free Parallelizable Framework for All-Electron Calculations in Density Functional TheoryExact Penalty Function for $\ell_{2,1}$ Norm Minimization over the Stiefel Manifold


Uses Software


Cites Work