On a primal-dual Newton proximal method for convex quadratic programs (Q2114815): Difference between revisions

From MaRDI portal
← Older edit
ReferenceBot (talk | contribs)
Bots
1,903,984 edits
‎Changed an Item
Import241208061232 (talk | contribs)
1,083,878 edits
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/s10589-021-00342-y / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S10589-021-00342-Y / rank
 
Normal rank

Latest revision as of 02:54, 17 December 2024

scientific article
Language Label Description Also known as
English
On a primal-dual Newton proximal method for convex quadratic programs
scientific article

    Statements

    title
    On a primal-dual Newton proximal method for convex quadratic programs (English)
    0 references
    author
    Alberto De Marchi
    0 references
    publication date
    15 March 2022
    0 references
    zbMATH Keywords
    semismooth Newton method
    0 references
    proximal point method
    0 references
    regularized primal-dual method
    0 references
    convex quadratic programming
    0 references
    describes a project that uses
    NASOQ
    0 references
    SuperMann
    0 references
    Gurobi
    0 references
    Mosek
    0 references
    ALGENCAN
    0 references
    OSQP
    0 references
    NETLIB LP Test Set
    0 references
    SCS
    0 references
    CHOLMOD
    0 references
    QPALM
    0 references
    qpOASES
    0 references
    FBstab
    0 references
    cites work
    Q3690580
    0 references
    Q4821526
    0 references
    Q5491447
    0 references
    Q4235027
    0 references
    On NCP-functions
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C20
    0 references
    90C25
    0 references
    90C53
    0 references
    zbMATH DE Number
    7490077
    0 references
    OpenAlex ID
    W4206004106
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2114815&oldid=38887474"
    Powered by MediaWiki