Two relaxation methods for rank minimization problems (Q2198528)

From MaRDI portal
Revision as of 14:59, 1 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Two relaxation methods for rank minimization problems
scientific article

    Statements

    Two relaxation methods for rank minimization problems (English)
    0 references
    0 references
    0 references
    0 references
    10 September 2020
    0 references
    0 references
    constraint qualification
    0 references
    optimality conditions
    0 references
    rank minimization
    0 references
    semidefinite programs with complementarity constraints
    0 references