arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1010.0851math.OCcs.NAmath.NA
收藏

矩阵秩最小化的逼近理论及其在二次方程中的应用

Approximation Theory of Matrix Rank Minimization and Its Application to Quadratic Equations

University of Birmingham(伯明翰大学)

Yun-Bin Zhao

AI总结:

本文提出矩阵秩最小化问题的逼近理论,证明可通过连续优化(特别是线性和非线性半定规划)任意精度逼近,并应用于二次方程组解的存在性判定。

摘要:

矩阵秩最小化问题在数学和工程领域正受到越来越多的关注。这类问题出现在各种跨学科应用中,通常被认为是NP难的。本文旨在为秩最小化问题提供逼近理论,并证明秩最小化问题可以通过连续优化(特别是线性和非线性半定规划)问题逼近到任意精度。本文的主要结果之一表明,如果问题的可行集具有最小F-范数(即Frobenius范数)的最小秩元素,则当逼近参数趋于零时,逼近问题的解收敛到原始问题的最小秩解。还讨论了逼近问题在特定条件下的可处理性和凸松弛。本文的方法和结果为开发求解秩最小化问题的有效计算方法提供了新的理论基础。本文还展示了该理论在二次方程组中的直接应用。结果表明,此类系统无非零解的条件可以通过秩最小化问题来刻画,因此所提出的逼近理论可用于建立系统仅有零解的充分条件。

英文摘要:

Matrix rank minimization problems are gaining a plenty of recent attention in both mathematical and engineering fields. This class of problems, arising in various and across-discipline applications, is known to be NP-hard in general. In this paper, we aim at providing an approximation theory for the rank minimization problem, and prove that a rank minimization problem can be approximated to any level of accuracy via continuous optimization (especially, linear and nonlinear semidefinite programming) problems. One of the main results in this paper shows that if the feasible set of the problem has a minimum rank element with the least F-norm (i.e., Frobenius norm), then the solution of the approximation problem converges to the minimum rank solution of the original problem as the approximation parameter tends to zero. The tractability under certain conditions and convex relaxation of the approximation problem are also discussed. The methodology and results in this paper provide a new theoretical basis for the development of some efficient computational methods for solving rank minimization problems. An immediate application of this theory to the system of quadratic equations is presented in this paper. It turns out that the condition for such a system without a nonzero solution can be characterized by a rank minimization problem, and thus the proposed approximation theory can be used to establish some sufficient conditions for the system to possess only zero solution.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑