Some generalizations of the criss-cross method for quadratic programming (Q4327908): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1262208
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Emil Klafszky / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331939208843783 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015176580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality Theory of Linear Programs: A Constructive Approach with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of some quadratic programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial abstraction of linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least-index resolution of degeneracy in 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: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The general quadratic optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variants of the Hungarian method for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial approach to convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergent criss-cross method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite crisscross method for oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\ell_ p\) programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity in Oriented Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear quadratic programming in oriented matroids / 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: The Simplex Method for Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Criss-Cross Method for Solving Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Empirical Tests of the Criss-Cross Method / rank
 
Normal rank

Latest revision as of 11:27, 23 May 2024

scientific article; zbMATH DE number 737323
Language Label Description Also known as
English
Some generalizations of the criss-cross method for quadratic programming
scientific article; zbMATH DE number 737323

    Statements

    Some generalizations of the criss-cross method for quadratic programming (English)
    0 references
    0 references
    0 references
    0 references
    11 June 1995
    0 references
    least index resolution
    0 references
    simplex method
    0 references
    criss-cross method
    0 references
    quadratic programming
    0 references
    pivoting methods
    0 references
    linear complementarity problem
    0 references

    Identifiers