1 citations · 1 across the 1 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2022★ 1 cited
A Globally Convergent LP and SOCP-based algorithm for Semidefinite Programming
Biel Roig-Solvas, Mario Sznaier
Semidefinite programs (SDP) are one of the most versatile frameworks in numerical optimization, serving as generalizations of many conic programs and as relaxations of NP-hard comb…
math.OC2019
Chordal Decomposition in Rank Minimized Semidefinite Programs with Applications to Subspace Clustering
Jared Miller, Yang Zheng, Biel Roig-Solvas +2
Semidefinite programs (SDPs) often arise in relaxations of some NP-hard problems, and if the solution of the SDP obeys certain rank constraints, the relaxation will be tight. Decom…
math.OC2018
A Proximal Operator for Multispectral Phase Retrieval Problems
Biel Roig-Solvas, Lee Makowski, Dana H. Brooks
Proximal algorithms have gained popularity in recent years in large-scale and distributed optimization problems. One such problem is the phase retrieval problem, for which proximal…