Low-Rank Semidefinite Programming: Theory and Applications
Foundations and Trends® in Optimization · 2016
DOI: 10.1561/2400000009 ↗Kurz gefasst
Fachartikel in der Zeitschrift Foundations and Trends® in Optimization, 2016. Verfasst von Alex Lemon und 2 weiteren Autor:innen. Die Arbeit wurde bisher 34-mal zitiert (Crossref) und nennt 105 Literaturangaben.
Abstract (Originalsprache)
Finding low-rank solutions of semidefinite programs is important in many applications. For example, semidefinite programs that arise as relaxations of polynomial optimization problems are exact relaxations when the semidefinite program has a rank-1 solution. Unfortunately, computing a minimum-rank solution of a semidefinite program is an NP-hard problem. In this paper we review the theory of low-rank semidefinite programming, presenting theorems that guarantee the existence of a low-rank solution, heuristics for computing low-rank solutions, and algorithms for finding low-rank approximate solutions. Then we present applications of the theory to trust-region problems and signal processing.
Zitieren
APA
Lemon, A., So, A. M., & Ye, Y. (2016). Low-Rank Semidefinite Programming: Theory and Applications. Foundations and Trends® in Optimization. https://doi.org/10.1561/2400000009
Vancouver
Lemon A, So AM, Ye Y. Low-Rank Semidefinite Programming: Theory and Applications. Foundations and Trends® in Optimization. 2016. doi:10.1561/2400000009
BibTeX
@article{Lemon2016,
author = {Lemon, Alex and So, Anthony Man-Cho and Ye, Yinyu},
title = {Low-Rank Semidefinite Programming: Theory and Applications},
journal = {Foundations and Trends® in Optimization},
year = {2016},
doi = {10.1561/2400000009}
}
EUVIMED