A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems (Q2307755)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
scientific article

    Statements

    A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2020
    0 references
    The authors formulate an inertial version of the PALM method for minimizing the sum of two nonsmooth (possibly also nonconvex) functions in separate variables connected by a smooth coupling function. The inertial step is performed once of the two subproblems is addressed, it is formulated in the spirit of a Gauss-Seidel type method. Subsequence convergence and, in the Kurdyka-Lojasiewicz setting, global convergence of the generated sequence to a critical point are proved. Comparisons to PALM and to another inertial version of it are carried out in the context of solving signal recovery, image denoising and nonnegative matrix factorization models.
    0 references
    Gauss-Seidel
    0 references
    inertial
    0 references
    alternating proximal linearized minimization
    0 references
    Kurdyka-Łojasiewicz property
    0 references
    nonconvex-nonsmooth optimization
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers