A new proof for the criss-cross method for quadratic programming (Q4327956): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of LCPs associated with positive definite symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finiteness of the criss-cross method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The general quadratic optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential example for Terlaky's pivoting rule for the criss-cross simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergent criss-cross method / rank
 
Normal rank

Latest revision as of 11:28, 23 May 2024

scientific article; zbMATH DE number 737370
Language Label Description Also known as
English
A new proof for the criss-cross method for quadratic programming
scientific article; zbMATH DE number 737370

    Statements

    Identifiers