5 citations · 8 across the 3 of their papers we have counts for
4 papers
The landscape of deterministic and stochastic optimal control problems: One-shot Optimization versus Dynamic Programming
Jihun Kim, Yuhao Ding, Yingjie Bi +1
Optimal control problems can be solved via a one-shot (single) optimization or a sequence of optimization using dynamic programming (DP). However, the computation of their global o…
General Low-rank Matrix Optimization: Geometric Analysis and Sharper Bounds
Haixiang Zhang, Yingjie Bi, Javad Lavaei
This paper considers the global geometry of general low-rank minimization problems via the Burer-Monterio factorization approach. For the rank- case, we prove that there is no s…
Global and Local Analyses of Nonlinear Low-Rank Matrix Recovery Problems
Yingjie Bi, Javad Lavaei
The restricted isometry property (RIP) is a well-known condition that guarantees the absence of spurious local minima in low-rank matrix recovery problems with linear measurements.…
On Upper Bounding Shannon Capacity of Graph Through Generalized Conic Programming
Yingjie Bi, Ao Tang
The Shannon capacity of a graph is an important graph invariant in information theory that is extremely difficult to compute. The Lovasz number, which is based on semidefinite prog…