weetabixharry
- 111
- 0
I have a complex matrix, \textbf{A}, and I want to left-multiply it by a unitary matrix, \textbf{U} (i.e. \textbf{U} is square and \textbf{U}^H\textbf{U}=\textbf{I}).
The goal is to find the \textbf{U} which yields the optimal solution \textbf{B}_{opt} \triangleq \textbf{U}\textbf{A}, where \textbf{B}_{opt} is optimal in the sense that its element-wise magnitudes are all simultaneously as close as possible to unity.
That is, I would like to minimise something like: \underline{1}^T \left|\left(\left|\textbf{B}_{opt}\right|^2 - \underline{1}\underline{1}^T\right)\right|^2 \underline{1} (subject to \textbf{U}^H\textbf{U}=\textbf{I}), where \left|\textbf{B}_{opt}\right| denotes the element-by-element absolute value of \textbf{B}_{opt} and \underline{1} is a column vector of ones.
How can I approach this problem? I have tried to find a solution using Lagrange multipliers, but I can't seem to gain any insight into how to design \textbf{U}. What other sorts of methods are available for this type of problem?
Any advice is greatly appreciated!
The goal is to find the \textbf{U} which yields the optimal solution \textbf{B}_{opt} \triangleq \textbf{U}\textbf{A}, where \textbf{B}_{opt} is optimal in the sense that its element-wise magnitudes are all simultaneously as close as possible to unity.
That is, I would like to minimise something like: \underline{1}^T \left|\left(\left|\textbf{B}_{opt}\right|^2 - \underline{1}\underline{1}^T\right)\right|^2 \underline{1} (subject to \textbf{U}^H\textbf{U}=\textbf{I}), where \left|\textbf{B}_{opt}\right| denotes the element-by-element absolute value of \textbf{B}_{opt} and \underline{1} is a column vector of ones.
How can I approach this problem? I have tried to find a solution using Lagrange multipliers, but I can't seem to gain any insight into how to design \textbf{U}. What other sorts of methods are available for this type of problem?
Any advice is greatly appreciated!