A decomposition algorithm for quadratic programming (Q3870676): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Routing in a Packet-Switched Computer Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Large-Scale Mathematical Programming Part I: Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über den Aufwand zur Lösung quadratischer Optimierungsprobleme mit den Algorithmen von Beale und von Lemke / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm to maximize certain pseudoconcave functions on polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial decomposition in nonlinear programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the frank and Wolfe method of feasible directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust implementation of Lemke's method for the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564917 / rank
 
Normal rank

Latest revision as of 04:50, 13 June 2024

scientific article
Language Label Description Also known as
English
A decomposition algorithm for quadratic programming
scientific article

    Statements

    A decomposition algorithm for quadratic programming (English)
    0 references
    0 references
    1980
    0 references
    0 references
    0 references
    0 references
    0 references
    computational experience
    0 references
    decomposition algorithm
    0 references
    pivot algorithm
    0 references
    Lemke's method
    0 references
    finiteness of the algorithm
    0 references
    unbounded feasible region
    0 references
    comparison of algorithms
    0 references
    0 references