Algorithmic equivalence in quadratic programming. I. A least-distance programming problem (Q1250029): 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: Q4132018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Symmetric Formulation of the Simplex Method for Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Transformation of Which The Equation of Telegraphy is a Differential Invariant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5571406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3277015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:21, 13 June 2024

scientific article
Language Label Description Also known as
English
Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
scientific article

    Statements

    Algorithmic equivalence in quadratic programming. I. A least-distance programming problem (English)
    0 references
    0 references
    0 references
    0 references
    1979
    0 references
    0 references
    ALGORITHMIC EQUIVALENCE
    0 references
    QUADRATIC PROGRAMMING
    0 references