Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms (Q2063835)

From MaRDI portal
Revision as of 14:58, 27 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
Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms
scientific article

    Statements

    Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms (English)
    0 references
    0 references
    0 references
    3 January 2022
    0 references
    multi-agent systems
    0 references
    distributed resource allocation
    0 references
    nonsmooth cost function
    0 references
    directed graphs
    0 references
    splitting method
    0 references
    0 references

    Identifiers

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