Conjugate Gradient Algorithm for Optimization under Unitary Matrix Constraint
In this paper we introduce a Riemannian algorithm for minimizing (or maximizing) a real-valued function J of complex-valued matrix argument W under the constraint that W is an n×n unitary matrix. This type of constrained optimization problem arises in many array and multi-channel signal processing a...
Asıl Yazarlar: | Abrudan, T, Eriksson, J, Koivunen, V |
---|---|
Materyal Türü: | Journal article |
Baskı/Yayın Bilgisi: |
2015
|
Benzer Materyaller
-
Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
Yazar:: Abrudan, T, ve diğerleri
Baskı/Yayın Bilgisi: (2015) -
A Conjugate Gradient Type Method for the Nonnegative Constraints Optimization Problems
Yazar:: Can Li
Baskı/Yayın Bilgisi: (2013-01-01) -
ON J-UNITARY MATRIX POLYNOMIALS
Yazar:: Ephremidze, Lasha, ve diğerleri
Baskı/Yayın Bilgisi: (2022) -
Conjugate gradient algorithm for consistent generalized Sylvester-transpose matrix equations
Yazar:: Kanjanaporn Tansri, ve diğerleri
Baskı/Yayın Bilgisi: (2022-01-01) -
Unitary block optimization for variational quantum algorithms
Yazar:: Lucas Slattery, ve diğerleri
Baskı/Yayın Bilgisi: (2022-04-01)