%ARoig-Solvas, Biel%ASznaier, M.%D2021%I %K %MOSTI ID: 10349424 %PMedium: X %TGlobally Convergent Low Complexity Algorithms for Semidefinite Programming %XSemidefinite programs (SDP) are a staple of today’s systems theory, with applications ranging from robust control to systems identification. However, current state-of-the art solution methods have poor scaling properties, and thus are limited to relatively moderate size problems. Recently, several approximations have been proposed where the original SDP is relaxed to a sequence of lower complexity problems (such as linear programs (LPs) or second order cone programs (SOCPs)). While successful in many cases, there is no guarantee that these relaxations converge to the global optimum of the original program. Indeed, examples exists where these relaxations "get stuck" at suboptimal solutions. To circumvent this difficulty in this paper we propose an algorithm to solve SDPs based on solving a sequence of LPs or SOCPs, guaranteed to converge in a finite number of steps to an ε-suboptimal solution of the original problem. We further provide a bound on the number of steps required, as a function of ε and the problem data. Country unknown/Code not availablehttps://doi.org/10.1109/CDC45484.2021.9682942OSTI-MSA