Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Globally Convergent LP and SOCP-based algorithm for Semidefinite
  Programming   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 combinatorial problems. Their main drawback is their
computational and memory complexity, which sets a practical limit to the size
of problems solvable by off-the-shelf SDP solvers. To circumvent this fact,
many algorithms have been proposed to exploit the structure of particular
problems and increase the scalability of SDPs for those problem instances.
Progress has been less steep, however, for general-case SDPs. In this paper,
motivated by earlier results by Ahmadi and Hall, we show that a general SDP can
be solved to $\epsilon$-optimality, in polynomial time, by performing a
sequence of less computationally demanding Linear or Second Order Cone
programs. In addition, we provide a bound on the number of iterations required
to achieve $\epsilon$-optimality. These results are illustrated using random
SDPs and well-known problems from the SDPLib dataset.

18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
14
The categories of this paper are: math-ph
23
The categories of this paper are: solv-int
1
The categories of this paper are: cs
7
The categories of this paper are: hep-th
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th
4
The categories of this paper are: cond-mat
13
The categories of this paper are: quant-ph
19
The categories of this paper are: eess
25
The categories of this paper are: patt-sol