Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Greedy Block Coordinate Descent (GBCD) Method for High Dimensional
  Quadratic Programs   High dimensional unconstrained quadratic programs (UQPs) involving massive
datasets are now common in application areas such as web, social networks, etc.
Unless computational resources that match up to these datasets are available,
solving such problems using classical UQP methods is very difficult. This paper
discusses alternatives. We first define high dimensional compliant (HDC)
methods for UQPs---methods that can solve high dimensional UQPs by adapting to
available computational resources. We then show that the class of block
Kaczmarz and block coordinate descent (BCD) are the only existing methods that
can be made HDC. As a possible answer to the question of the `best' amongst BCD
methods for UQP, we propose a novel greedy BCD (GBCD) method with serial,
parallel and distributed variants. Convergence rates and numerical tests
confirm that the GBCD is indeed an effective method to solve high dimensional
UQPs. In fact, it sometimes beats even the conjugate gradient.

22
The categories of this paper are: chao-dyn
31
The categories of this paper are: ao-sci
7
The categories of this paper are: hep-th
13
The categories of this paper are: quant-ph
28
The categories of this paper are: alg-geom
0
The categories of this paper are: hep-ph
36
The categories of this paper are: cmp-lg
10
The categories of this paper are: q-bio
20
The categories of this paper are: acc-phys
5
The categories of this paper are: gr-qc
30
The categories of this paper are: q-alg
24
The categories of this paper are: dg-ga
19
The categories of this paper are: eess
11
The categories of this paper are: hep-lat
14
The categories of this paper are: math-ph
37
The categories of this paper are: supr-con