Network manipulation algorithm based on inexact alternating minimization (Q2109010)

From MaRDI portal
Revision as of 02:11, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Network manipulation algorithm based on inexact alternating minimization
scientific article

    Statements

    title
    Network manipulation algorithm based on inexact alternating minimization (English)
    0 references
    author
    David Müller
    0 references
    Vladimir Shikhman
    0 references
    publication date
    20 December 2022
    0 references
    zbMATH Keywords
    network manipulation
    0 references
    inexact alternating minimization
    0 references
    discrete choice
    0 references
    strong convexity
    0 references
    cites work
    Q4872459
    0 references
    Reaching a Consensus
    0 references
    Markov Chains
    0 references
    Q4185581
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90Bxx
    0 references
    90C25
    0 references
    90C35
    0 references
    90C90
    0 references
    zbMATH DE Number
    7634982
    0 references
    OpenAlex ID
    W3178569457
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2109010&oldid=38883371"
    Powered by MediaWiki