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...
Main Authors: | Abrudan, T, Eriksson, J, Koivunen, V |
---|---|
Format: | Journal article |
Published: |
2015
|
Similar Items
-
Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
by: Abrudan, T, et al.
Published: (2015) -
ON J-UNITARY MATRIX POLYNOMIALS
by: Ephremidze, Lasha, et al.
Published: (2022) -
Diagonal preconditioned conjugate gradient algorithm for unconstrained optimization
by: Ng, Choong Boon, et al.
Published: (2014) -
Unitary block optimization for variational quantum algorithms
by: Lucas Slattery, et al.
Published: (2022-04-01) -
Improved conjugate gradient algorithms /
by: 371402 Rio Hirowati Sharifuddin, et al.
Published: ([199)