Constrained density functional theory (CDFT) provides a powerful framework for describing electronically excited and charge-localized states, which underlie a broad range of physical and chemical phenomena. However, the discretized optimization problems arising from CDFT calculations remain challenging, owing to the presence of both the Stiefel manifold constraint and additional nonconvex quadratic constraints. Existing algorithms either fail to enforce the quadratic constraints with high accuracy or face convergence issues due to double-loop iterative structures. In this paper, we first derive a subspace-splitting reformulation that decouples the two groups of constraints, by exploiting the inherent rotation invariance and introducing a nonlinear subspace alignment constraint. Based on this reformulation, we propose a single-loop damped alternating direction method of multipliers, called DASSP. To the best of our knowledge, DASSP is the first algorithm for CDFT calculations with rigorous convergence guarantees. Each iteration of DASSP comprises a spectral minimization step, a projected gradient step, and a damped dual ascent step, all of which admit efficient implementations. Numerical results on synthetic and realistic CDFT problems demonstrate that DASSP attains high feasibility accuracy and exhibits favorable efficiency without compromising robustness. We expect that this work will pave the way toward reliable and efficient large-scale CDFT applications.
The proposed reformulation of the total scaled-gradient variation regularizer achieves PSNR and SSIM competitive with or superior to representative variational methods, especially at high noise levels, and improves the structural reconstruction under dense and sparse scanning.
Hai-Bin Su, Chunlin Wu, Huibin Chang et al.· 0 citations
The classical Projected Hessian Lemma, originating from Finsler's theorem, characterizes definiteness over a constraint null space through quadratic penalties. However, it does not quantify the corresponding constrained eigenvalues or the associated eigenvalue penalty path. This work develops a quantitative penalty the...
A recursive module-coupling algorithm, which iteratively treats a system as a composition of locally-coupled smaller modules, with low-energy subspace estimated successively according to the same recursive structure, leading naturally to a recursive quantum variational algorithm, providing a systematic and modular circ...
Di-Hang Sun, Nan-Nan Ma, Ching-Hua Lee et al.· 0 citations
A coupled perturbation analysis for the entire PPMD procedure identifies how the principal errors interact and which components limit the accuracy of the nonlinear reduced order model.
A hyperbolic-majorization preconditioned three-term nonlinear conjugate-gradient framework for nonconvex finite minimax optimization that yields a Dai--Liao-type conjugacy relation, enhanced sufficient descent, a smoothing-parameter-uniform Armijo lower bound, fixed-smoothing global first-order convergence and complexi...
Wen-Zhe Zhao· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.