Pages that link to "Item:Q1250029"
From MaRDI portal
The following pages link to Algorithmic equivalence in quadratic programming. I. A least-distance programming problem (Q1250029):
Displayed 6 items.
- Active constraints, indefinite quadratic test problems, and complexity (Q911993) (← links)
- Some n by dn linear complementarity problems (Q1151241) (← links)
- Analysis and implementation of a dual algorithm for constrained optimization (Q1321425) (← links)
- Equivalence of some quadratic programming algorithms (Q3343781) (← links)
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem (Q3720303) (← links)
- An equivalence between two algorithms for quadratic programming (Q3895232) (← links)