Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Linearly Convergent First-Order Algorithms for Semi-definite Programming   In this paper, we consider two formulations for Linear Matrix Inequalities
(LMIs) under Slater type constraint qualification assumption, namely, SDP
smooth and non-smooth formulations. We also propose two first-order linearly
convergent algorithms for solving these formulations. Moreover, we introduce a
bundle-level method which converges linearly uniformly for both smooth and
non-smooth problems and does not require any smoothness information. The
convergence properties of these algorithms are also discussed. Finally, we
consider a special case of LMIs, linear system of inequalities, and show that a
linearly convergent algorithm can be obtained under a weaker assumption.

17
The categories of this paper are: q-fin
15
The categories of this paper are: nucl-ex
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
33
The categories of this paper are: plasm-ph
0
The categories of this paper are: hep-ph
22
The categories of this paper are: chao-dyn
21
The categories of this paper are: adap-org
31
The categories of this paper are: ao-sci
30
The categories of this paper are: q-alg
12
The categories of this paper are: nucl-th
32
The categories of this paper are: atom-ph
24
The categories of this paper are: dg-ga
3
The categories of this paper are: physics