Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An ${\cal O}(nL)$ Infeasible-Interior-Point Algorithm for Linear
  Programming   In this paper, we propose an arc-search infeasible-interior-point algorithm.
We show that this algorithm is polynomial and the polynomial bound is ${\cal
O}(nL)$ which is at least as good as the best existing bound for
infeasible-interior-point algorithms for linear programming.

14
The categories of this paper are: math-ph
0
The categories of this paper are: hep-ph
3
The categories of this paper are: physics
31
The categories of this paper are: ao-sci
15
The categories of this paper are: nucl-ex
24
The categories of this paper are: dg-ga
1
The categories of this paper are: cs
16
The categories of this paper are: stat
19
The categories of this paper are: eess
12
The categories of this paper are: nucl-th
18
The categories of this paper are: econ
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
8
The categories of this paper are: hep-ex
5
The categories of this paper are: gr-qc
35
The categories of this paper are: mtrl-th