An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs (Q5244155): Difference between revisions

From MaRDI portal
← Older edit
ReferenceBot (talk | contribs)
Bots
1,903,984 edits
‎Changed an Item
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2990866132 / rank
 
Normal rank

Latest revision as of 08:22, 30 July 2024

scientific article; zbMATH DE number 7133196
Language Label Description Also known as
English
An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs
scientific article; zbMATH DE number 7133196

    Statements

    title
    An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs (English)
    0 references
    author
    Chuangchuang Sun
    0 references
    Ran Dai
    0 references
    publication date
    20 November 2019
    0 references
    zbMATH Keywords
    quadratically constrained quadratic programming
    0 references
    semidefinite programming
    0 references
    nonconvex optimization
    0 references
    augmented Lagrangian method
    0 references
    linear convergence
    0 references
    describes a project that uses
    NLPLIB
    0 references
    TOMLAB
    0 references
    SNLSDP
    0 references
    OPERA
    0 references
    SeDuMi
    0 references
    SDPT3
    0 references
    cites work
    Q4830373
    0 references
    Q3151174
    0 references
    Q3038523
    0 references
    Q4057472
    0 references

    Identifiers

    DOI
    10.1137/17M1147214
    0 references
    Mathematics Subject Classification ID
    90C20
    0 references
    90C26
    0 references
    90C22
    0 references
    zbMATH DE Number
    7133196
    0 references
    arXiv ID
    1609.02609
    0 references
    Wikidata QID
    Q126775685
    0 references
    OpenAlex ID
    W2990866132
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5244155&oldid=36866063"
    Powered by MediaWiki