Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A proximal minimization algorithm for structured nonconvex and nonsmooth
  problems   We propose a proximal algorithm for minimizing objective functions consisting
of three summands: the composition of a nonsmooth function with a linear
operator, another nonsmooth function, each of the nonsmooth summands depending
on an independent block variable, and a smooth function which couples the two
block variables. The algorithm is a full splitting method, which means that the
nonsmooth functions are processed via their proximal operators, the smooth
function via gradient steps, and the linear operator via matrix times vector
multiplication. We provide sufficient conditions for the boundedness of the
generated sequence and prove that any cluster point of the latter is a KKT
point of the minimization problem. In the setting of the Kurdyka-\L{}ojasiewicz
property we show global convergence, and derive convergence rates for the
iterates in terms of the \L{}ojasiewicz exponent.

36
The categories of this paper are: cmp-lg
12
The categories of this paper are: nucl-th
16
The categories of this paper are: stat
30
The categories of this paper are: q-alg
33
The categories of this paper are: plasm-ph
14
The categories of this paper are: math-ph
9
The categories of this paper are: nlin
19
The categories of this paper are: eess
21
The categories of this paper are: adap-org
4
The categories of this paper are: cond-mat
31
The categories of this paper are: ao-sci
15
The categories of this paper are: nucl-ex
5
The categories of this paper are: gr-qc
7
The categories of this paper are: hep-th
3
The categories of this paper are: physics
17
The categories of this paper are: q-fin