Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Automatic Repair of Convex Optimization Problems   Given an infeasible, unbounded, or pathological convex optimization problem,
a natural question to ask is: what is the smallest change we can make to the
problem's parameters such that the problem becomes solvable? In this paper, we
address this question by posing it as an optimization problem involving the
minimization of a convex regularization function of the parameters, subject to
the constraint that the parameters result in a solvable problem. We propose a
heuristic for approximately solving this problem that is based on the penalty
method and leverages recently developed methods that can efficiently evaluate
the derivative of the solution of a convex cone program with respect to its
parameters. We illustrate our method by applying it to examples in optimal
control and economics.

25
The categories of this paper are: patt-sol
30
The categories of this paper are: q-alg
29
The categories of this paper are: funct-an
6
The categories of this paper are: astro-ph
11
The categories of this paper are: hep-lat
5
The categories of this paper are: gr-qc
8
The categories of this paper are: hep-ex
23
The categories of this paper are: solv-int
37
The categories of this paper are: supr-con
19
The categories of this paper are: eess
7
The categories of this paper are: hep-th
17
The categories of this paper are: q-fin
16
The categories of this paper are: stat
4
The categories of this paper are: cond-mat
32
The categories of this paper are: atom-ph
28
The categories of this paper are: alg-geom