a Rank Minimization Heuristic with Application to Minimum Order System Approximation: Difference between revisions
Jump to navigation
Jump to search
(Created page with "Rank Minimization Problem (RMP) has application in a variety of areas such as control, system identification, statistics and signal processing. Excep in some special cases RMP is...") |
No edit summary |
||
| Line 2: | Line 2: | ||
<math> | <math> | ||
\align | \begin{align} | ||
\mbox{minimize} & \mbox{Rank $X$} \\ | \mbox{minimize} & \mbox{Rank $X$} \\ | ||
\ | |||
\end{align} | |||
</math> | |||
Revision as of 19:57, 23 November 2010
Rank Minimization Problem (RMP) has application in a variety of areas such as control, system identification, statistics and signal processing. Excep in some special cases RMP is known to be computationaly hard. If the matrix is symmetric and positive semidifinite, trace minimization is a very effective heuristic for rank minimization problem. The trace minimization results in a semidefinite problem which can be easily solved.
[math]\displaystyle{ \begin{align} \mbox{minimize} & \mbox{Rank $X$} \\ \end{align} }[/math]