Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators (Q452270)

From MaRDI portal
Revision as of 16:39, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
scientific article

    Statements

    Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators (English)
    0 references
    20 September 2012
    0 references
    In the paper, a primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators is considered. Various problems already considered in the literature, which the above mentioned problem contains as particular cases, are presented. In the algorithm, the single-valued operators are processed individually via explicit steps, while the set-valued operators are processed implicitly via their resolvents. Thus, this new splitting method can be well used for numerical purposes. This algorithm can also be applied to minimization problems.
    0 references
    maximal monotone operator
    0 references
    monotone inclusion
    0 references
    nonsmooth convex optimization
    0 references
    parallel sum
    0 references
    set-valued duality
    0 references
    splitting algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references