Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
In many engineering applications we deal with constrained optimization problems with respect to complex-valued matrices. This paper proposes a Riemannian geometry approach for optimization of a real-valued cost function J of complex-valued matrix argument W, under the constraint that W is an n times...
| Autors principals: | , , |
|---|---|
| Format: | Journal article |
| Publicat: |
2015
|