Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Distributed Interior-point Method for Loosely Coupled Problems   In this paper, we put forth distributed algorithms for solving loosely
coupled unconstrained and constrained optimization problems. Such problems are
usually solved using algorithms that are based on a combination of
decomposition and first order methods. These algorithms are commonly very slow
and require many iterations to converge. In order to alleviate this issue, we
propose algorithms that combine the Newton and interior-point methods with
proximal splitting methods for solving such problems. Particularly, the
algorithm for solving unconstrained loosely coupled problems, is based on
Newton's method and utilizes proximal splitting to distribute the computations
for calculating the Newton step at each iteration. A combination of this
algorithm and the interior-point method is then used to introduce a distributed
algorithm for solving constrained loosely coupled problems. We also provide
guidelines on how to implement the proposed methods efficiently and briefly
discuss the properties of the resulting solutions.

11
The categories of this paper are: hep-lat
10
The categories of this paper are: q-bio
36
The categories of this paper are: cmp-lg
19
The categories of this paper are: eess
5
The categories of this paper are: gr-qc
34
The categories of this paper are: chem-ph
14
The categories of this paper are: math-ph
20
The categories of this paper are: acc-phys
31
The categories of this paper are: ao-sci
32
The categories of this paper are: atom-ph
1
The categories of this paper are: cs
33
The categories of this paper are: plasm-ph
7
The categories of this paper are: hep-th
28
The categories of this paper are: alg-geom
17
The categories of this paper are: q-fin
12
The categories of this paper are: nucl-th