Pages that link to "Item:Q2539951"
From MaRDI portal
The following pages link to A combinatorial approach to convex quadratic programming (Q2539951):
Displaying 10 items.
- Almost definiteness of matrices on polyhedral cones (Q1183149) (← links)
- Determining subspaces on which a matrix is nonnegative definite (Q1189625) (← links)
- A saddlepoint theorem for self-dual linear systems (Q1215686) (← links)
- Criteria for sufficient matrices (Q1906774) (← links)
- The Boolean pivot operation, \(M\)-matrices, and reducible matrices (Q2365720) (← links)
- A combinatorial approach to convex quadratic programming (Q2539951) (← links)
- On the number of solutions to the complementarity problem and spanning properties of complementary cones (Q2553906) (← links)
- Some generalizations of the criss-cross method for quadratic programming (Q4327908) (← links)
- The general quadratic optimization problem (Q4401736) (← links)
- Hybrid programs: Linear and least-distance (Q5661715) (← links)
