Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An optimal subgradient algorithm for large-scale bound-constrained
  convex optimization   This paper shows that the OSGA algorithm -- which uses first-order
information to solve convex optimization problems with optimal complexity --
can be used to efficiently solve arbitrary bound-constrained convex
optimization problems. This is done by constructing an explicit method as well
as an inexact scheme for solving the bound-constrained rational subproblem
required by OSGA. This leads to an efficient implementation of OSGA on
large-scale problems in applications arising signal and image processing,
machine learning and statistics. Numerical experiments demonstrate the
promising performance of OSGA on such problems. ions to show the efficiency of
the proposed scheme. A software package implementing OSGA for bound-constrained
convex problems is available.

20
The categories of this paper are: acc-phys
28
The categories of this paper are: alg-geom
21
The categories of this paper are: adap-org
7
The categories of this paper are: hep-th
10
The categories of this paper are: q-bio
3
The categories of this paper are: physics
23
The categories of this paper are: solv-int
22
The categories of this paper are: chao-dyn
31
The categories of this paper are: ao-sci
17
The categories of this paper are: q-fin
30
The categories of this paper are: q-alg
14
The categories of this paper are: math-ph
32
The categories of this paper are: atom-ph
18
The categories of this paper are: econ
25
The categories of this paper are: patt-sol
35
The categories of this paper are: mtrl-th