New variants of the criss-cross method for linearly constrained convex quadratic programming (Q1877024)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New variants of the criss-cross method for linearly constrained convex quadratic programming |
scientific article; zbMATH DE number 2091289
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New variants of the criss-cross method for linearly constrained convex quadratic programming |
scientific article; zbMATH DE number 2091289 |
Statements
New variants of the criss-cross method for linearly constrained convex quadratic programming (English)
0 references
16 August 2004
0 references
Linearly constrained convex quadratic optimization
0 references
Linear complementarity problems
0 references
Criss-cross type algorithms
0 references
0 references
0 references
