5 citations · 22 across the 25 of their papers we have counts for
Showing 2022 · math.OCShow all
2 papers · 2 filters
math.OC2022
Semidefinite Programming versus Burer-Monteiro Factorization for Matrix Sensing
Baturalp Yalcin, Ziye Ma, Javad Lavaei +1
Many fundamental low-rank optimization problems, such as matrix completion, phase synchronization/retrieval, power system state estimation, and robust PCA, can be formulated as the…
math.OC2022
A New Complexity Metric for Nonconvex Rank-one Generalized Matrix Completion
Haixiang Zhang, Baturalp Yalcin, Javad Lavaei +1
In this work, we develop a new complexity metric for an important class of low-rank matrix optimization problems in both symmetric and asymmetric cases, where the metric aims to qu…