A Note on a Lower Bound on the Minimum Rank of a Positive Semidefinite Hankel Matrix Rank Minimization Problem
This paper investigates the problem of approximating the global minimum of a positive semidefinite Hankel matrix minimization problem with linear constraints. We provide a lower bound on the objective of minimizing the rank of the Hankel matrix in the problem based on conclusions from nonnegative po...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2021-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2021/2524016 |