Approximating Quadratic Programs with Positive Semidefinite Constraints
msra
摘要
We describe a polynomial time approximation algorithm to the problem of maximizing a quadratic form subject to quadratic constraints specified by PSD matrices. A special case, that has applications for clustering (CW04), is optimizing quadratic forms over the unit cube. Approximation algorithms with similar guarantees are known (Nes98, NRT99, Meg01, CW04), and there is evidence that this factor is optimal (ABH+). The following analysis is particularly simple.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要