2009
DOI: 10.1016/j.sigpro.2009.03.015
|View full text |Cite
|
Sign up to set email alerts
|

Conjugate gradient algorithm for optimization under unitary matrix constraint

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
98
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 92 publications
(98 citation statements)
references
References 20 publications
0
98
0
Order By: Relevance
“…Because L is a quasiperiodic function along [90,91], the period of its fastest oscillation λ0 can be estimated from the largest absolute eigenvalue |ω|max of θ as λ0 " π{2|ω|max. This expression can be derived when the Lagrangian has fourth-order dependence on the orbitals [92], as is the case here due to the two-electron integrals.…”
Section: Computational Detailsmentioning
confidence: 99%
“…Because L is a quasiperiodic function along [90,91], the period of its fastest oscillation λ0 can be estimated from the largest absolute eigenvalue |ω|max of θ as λ0 " π{2|ω|max. This expression can be derived when the Lagrangian has fourth-order dependence on the orbitals [92], as is the case here due to the two-electron integrals.…”
Section: Computational Detailsmentioning
confidence: 99%
“…for the isometry g s using a conjugate gradient algorithm adapted to unitary manifolds 37 , we then iteratively update the left and right fixed points of Eq. (7) until convergence of Eq.…”
Section: Coarse-graining Transfer Matricesmentioning
confidence: 99%
“…As described in [3], this is the gradient update on a so-called Grassmann Manifold and forms the foundation of conjugate gradient algorithms. See [1] for signal processing optimization applications with unitary matrix constraint.…”
Section: Input Estimationmentioning
confidence: 99%