ResearchTrend.AI
A biconvex optimization for solving semidefinite programs via bilinear factorization
v1v2v3v4v5v6v7v8 (latest)

A biconvex optimization for solving semidefinite programs via bilinear factorization

En-Liang Hu
ArXiv (abs)PDFHTML

Papers citing "A biconvex optimization for solving semidefinite programs via bilinear factorization"

3 / 3 papers shown
Title
Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data
Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data
J. Tropp
A. Yurtsever
Madeleine Udell
Volkan Cevher
68
81
0
18 Jun 2017
No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis
No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis
Rong Ge
Chi Jin
Yi Zheng
132
436
0
03 Apr 2017
Dropping Convexity for Faster Semi-definite Optimization
Dropping Convexity for Faster Semi-definite Optimization
Srinadh Bhojanapalli
Anastasios Kyrillidis
Sujay Sanghavi
80
173
0
14 Sep 2015

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.