One way to solve the parametric quadratic programming problem (Q3912371): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic programming algorithm using conjugate search directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating computational efficiency: A stochastic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone solutions of the parametric linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isotone solutions of parametric linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parametric linear complementarity problem involving derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4118986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5623518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex Method for Quadratic Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:29, 13 June 2024

scientific article
Language Label Description Also known as
English
One way to solve the parametric quadratic programming problem
scientific article

    Statements

    One way to solve the parametric quadratic programming problem (English)
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    parametric quadratic programming
    0 references
    conjugate directions
    0 references
    reduced problem
    0 references
    reduced gradient
    0 references