4.3 Article

A Note on a Lower Bound on the Minimum Rank of a Positive Semidefinite Hankel Matrix Rank Minimization Problem

期刊

MATHEMATICAL PROBLEMS IN ENGINEERING
卷 2021, 期 -, 页码 -

出版社

HINDAWI LTD
DOI: 10.1155/2021/2524016

关键词

-

资金

  1. National Natural Science Foundation of China [11901424]
  2. NSF of Shanxi province [201801D121022]

向作者/读者索取更多资源

This study investigates the method of approximately finding the global minimum of a positive semidefinite Hankel matrix under linear constraints, and provides a lower bound on the objective function based on conclusions from nonnegative polynomials, semi-infinite programming, and the dual theorem. It is proven that this lower bound is almost half of the number of linear constraints in the optimization 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 polynomials, semi-infinite programming, and the dual theorem. We prove that the lower bound is almost half of the number of linear constraints of the optimization problem.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据