A new primal-dual path-following method for convex quadratic programming (Q539783): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C51 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5901072 / rank
 
Normal rank
Property / zbMATH Keywords
 
convex quadratic programming
Property / zbMATH Keywords: convex quadratic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
interior point methods
Property / zbMATH Keywords: interior point methods / rank
 
Normal rank
Property / zbMATH Keywords
 
primal-dual path-following methods
Property / zbMATH Keywords: primal-dual path-following methods / rank
 
Normal rank
Property / zbMATH Keywords
 
convergence of algorithms
Property / zbMATH Keywords: convergence of algorithms / rank
 
Normal rank

Revision as of 09:55, 1 July 2023

scientific article
Language Label Description Also known as
English
A new primal-dual path-following method for convex quadratic programming
scientific article

    Statements

    A new primal-dual path-following method for convex quadratic programming (English)
    0 references
    0 references
    30 May 2011
    0 references
    convex quadratic programming
    0 references
    interior point methods
    0 references
    primal-dual path-following methods
    0 references
    convergence of algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references