Pages that link to "Item:Q3902831"
From MaRDI portal
The following pages link to Least-index resolution of degeneracy in quadratic programming (Q3902831):
Displaying 10 items.
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids (Q584271) (← links)
- Almost copositive matrices (Q1120638) (← links)
- Almost definiteness of matrices on polyhedral cones (Q1183149) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming (Q1327826) (← links)
- Quadratic-programming criteria for copositive matrices (Q1823293) (← links)
- Systematic construction of examples for cycling in the simplex method (Q2489285) (← links)
- Equivalence of some quadratic programming algorithms (Q3343781) (← links)
- Some generalizations of the criss-cross method for quadratic programming (Q4327908) (← links)
