5 citations · 6 across the 4 of their papers we have counts for
5 papers
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…
Euclidean Distance Bounds for LMI Analytic Centers using a Novel Bound on the Lambert Function
Biel Roig-Solvas, Mario Sznaier
Linear matrix inequalities (LMIs) are ubiquitous in modern control theory, as well as in a variety of other fields in science and engineering. Their analytic centers, i.e. the maxi…
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…
Estimating the Anisotropy of Protein Structures from SAXS
Biel Roig-Solvas, Dana H. Brooks, Lee Makowski
In the field of small angle x-ray scattering (SAXS), the task of estimating the size of particles in solution is usually synonymous with the Guinier plot. The approximation behind…
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…