Low-rank quadratic semidefinite programming

Ganzhao Yuan, Zhenjie Zhang, Bernard Ghanem, Zhifeng Hao

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


Low rank matrix approximation is an attractive model in large scale machine learning problems, because it can not only reduce the memory and runtime complexity, but also provide a natural way to regularize parameters while preserving learning accuracy. In this paper, we address a special class of nonconvex quadratic matrix optimization problems, which require a low rank positive semidefinite solution. Despite their non-convexity, we exploit the structure of these problems to derive an efficient solver that converges to their local optima. Furthermore, we show that the proposed solution is capable of dramatically enhancing the efficiency and scalability of a variety of concrete problems, which are of significant interest to the machine learning community. These problems include the Top-k Eigenvalue problem, Distance learning and Kernel learning. Extensive experiments on UCI benchmarks have shown the effectiveness and efficiency of our proposed method. © 2012.
Original languageEnglish (US)
Pages (from-to)51-60
Number of pages10
StatePublished - Apr 2013

ASJC Scopus subject areas

  • Artificial Intelligence
  • Cognitive Neuroscience
  • Computer Science Applications


Dive into the research topics of 'Low-rank quadratic semidefinite programming'. Together they form a unique fingerprint.

Cite this