Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
From MaRDI portal
Cites work
- A conjugate gradient method for electronic structure calculations
- A constrained optimization algorithm for total energy minimization in electronic structure calculations
- A feasible method for optimization with orthogonality constraints
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- A proximal gradient method for ensemble density functional theory
- A splitting method for orthogonality constrained problems
- A Trust Region Direct Constrained Minimization Algorithm for the Kohn–Sham Equation
- Adaptive regularized self-consistent field iteration with exact Hessian for electronic structure calculation
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
- An efficient Gauss-Newton algorithm for symmetric low-rank product matrix approximations
- ARock: an algorithmic framework for asynchronous parallel coordinate updates
- Benchmarking optimization software with performance profiles.
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Gradient type optimization methods for electronic structure calculations
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- KSSOLV -- a MATLAB toolbox for solving the Kohn-Sham equations
- On the analysis of the discretized Kohn-Sham density functional theory
- On the Convergence of the Self-Consistent Field Iteration for a Class of Nonlinear Eigenvalue Problems
- On the convergence of the self-consistent field iteration in Kohn-Sham density functional theory
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- The Geometry of Algorithms with Orthogonality Constraints
- Trace-penalty minimization for large-scale eigenspace computation
- Two-Point Step Size Gradient Methods
Cited in
(36)- Parallel orthogonal factorization null-space method for dynamic quadratic programming
- Triangularized orthogonalization-free method for solving extreme eigenvalue problems
- A parallel orbital-updating based optimization method for electronic structure calculations
- Implicit steepest descent algorithm for optimization with orthogonality constraints
- An exact penalty approach for optimization with nonnegative orthogonality constraints
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- scientific article; zbMATH DE number 897451 (Why is no real title available?)
- Exact penalty function for \(\ell_{2,1}\) norm minimization over the Stiefel manifold
- A class of smooth exact penalty function methods for optimization problems with orthogonality constraints
- scientific article; zbMATH DE number 2217826 (Why is no real title available?)
- An Orthogonalization-Free Parallelizable Framework for All-Electron Calculations in Density Functional Theory
- Convergent and Orthogonality Preserving Schemes for Approximating the Kohn-Sham Orbitals
- An SAV Method for Imaginary Time Gradient Flow Model in Density Functional Theory
- Adaptive trust-region method on Riemannian manifold
- Stochastic Gauss-Newton algorithms for online PCA
- A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold
- A communication-efficient and privacy-aware distributed algorithm for sparse PCA
- A Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality Constraints
- Proximal quasi-Newton method for composite optimization over the Stiefel manifold
- A variance-reduced stochastic gradient tracking algorithm for decentralized optimization with orthogonality constraints
- An unconditionally energy-stable and orthonormality-preserving iterative scheme for the Kohn-Sham gradient flow based model
- Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem
- Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
- An adaptive regularized proximal Newton-type methods for composite optimization over the Stiefel manifold
- Two nonmonotone proximal gradient methods for nonsmooth optimization over the Stiefel manifold
- An infeasible projection-type algorithm for finding nonnegative ground state solutions of nonlinear Schrödinger equations
- An SQP-type proximal gradient method for composite optimization problems with equality constraints
- A randomized feasible algorithm for optimization with orthogonal constraints
- Multipliers correction methods for optimization problems over the Stiefel manifold
- An orthonormal gradient flow for computing ground state solution of two-dimensional dipolar fermion gas
- A smoothed augmented Lagrangian framework for convex optimization with nonsmooth constraints
- An unconditionally energy-stable and orthonormality-preserving scheme for the Kohn-Sham gradient flow based model based on a tetrahedral spectral element method
- Direct minimization on the complex Stiefel manifold in Kohn-Sham density functional theory for finite and extended systems
- Solving optimization problems over the Stiefel manifold by smooth exact penalty functions
- Efficient orbital-wise splitting SAV schemes for the Kohn-Sham gradient flow based model
- Parareal algorithm for gradient flow arising from orthogonality-constrained matrix optimization problems
This page was built for publication: Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230625)
