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...
主要な著者: | Abrudan, T, Eriksson, J, Koivunen, V |
---|---|
フォーマット: | Journal article |
出版事項: |
2015
|
類似資料
-
Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
著者:: Abrudan, T, 等
出版事項: (2015) -
A Conjugate Gradient Type Method for the Nonnegative Constraints Optimization Problems
著者:: Can Li
出版事項: (2013-01-01) -
ON J-UNITARY MATRIX POLYNOMIALS
著者:: Ephremidze, Lasha, 等
出版事項: (2022) -
Conjugate gradient algorithm for consistent generalized Sylvester-transpose matrix equations
著者:: Kanjanaporn Tansri, 等
出版事項: (2022-01-01) -
Unitary block optimization for variational quantum algorithms
著者:: Lucas Slattery, 等
出版事項: (2022-04-01)