A hybrid steepest descent method for constrained convex optimization (Q1012884)

From MaRDI portal
Revision as of 03:41, 3 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q108430612, #quickstatements; #temporary_batch_1712111774907)
scientific article
Language Label Description Also known as
English
A hybrid steepest descent method for constrained convex optimization
scientific article

    Statements

    title
    A hybrid steepest descent method for constrained convex optimization (English)
    0 references
    author
    Mathieu Gerard
    0 references
    Bart De Schutter
    0 references
    Verhaegen, Michel
    0 references
    published in
    Automatica
    0 references
    publication date
    23 April 2009
    0 references
    zbMATH Keywords
    real-time optimization
    0 references
    convex optimization
    0 references
    gradient methods
    0 references
    steepest descent method
    0 references
    hybrid systems
    0 references

    Identifiers

    zbMATH DE Number
    5546469
    0 references
    OpenAlex ID
    W2028193232
    0 references
    Wikidata QID
    Q108430612
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1012884&oldid=33227672"
    Powered by MediaWiki