从量子嵌入方法中出现的二次Grassmann流形优化问题
A quadratic Grassmann manifold optimization problem arising from quantum embedding methods
AI总结:
本文研究了在Grassmann流形上最小化二次函数的优化问题,提出通过辅助凸问题求解全局极小值,并改进Riemannian优化和SCF算法的性能,应用于量子嵌入方法中的浴轨道构造。
摘要:
本文提出了一个数学分析和数值策略,用于解决在Grassmann流形上最小化二次函数$J(P) = \text{Tr}(BP)- \frac{1}{2} \text{Tr}(A P A P)$的问题,其中$A,B \in \mathbb R^{M \times M}_{\rm sym}$,且$A \succeq 0$。尽管该问题非凸且通常存在非全局局部极小值, posing挑战给Riemannian优化和自洽场(SCF)算法,但我们识别出某些情况下可通过求解辅助凸问题获得全局极小值。当此方法不直接适用时,辅助问题的解仍能作为Riemannian优化方法和SCF算法的有效初始化,显著提升其性能。本文受量子嵌入方法应用的启发,特别是浴轨道构造中自然出现的此类优化问题。
英文摘要:
This article presents a mathematical analysis and numerical strategies for solving the optimization problem of minimizing the quadratic function $J(P) = \text{Tr}(BP)- \frac{1}{2} \text{Tr}(A P A P)$, where $A,B \in \mathbb R^{M \times M}_{\rm sym}$, with $A \succeq 0$, over the Grassmann manifold ${\rm Gr}(m,\mathbb R^M)$. While this problem is non-convex and typically admits non-global local minima - posing challenges for Riemannian optimization and self-consistent field (SCF) algorithms - we identify cases where the global minimizer can be obtained by solving an auxiliary convex problem. When this approach is not directly applicable, the solution to the auxiliary problem still serves as an effective initialization for Riemannian optimization methods and SCF algorithms, significantly improving their performance. This work is motivated by applications in quantum embedding methods, particularly in the construction of bath orbitals, where such optimization problems naturally arise.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。