The Simplex Method for Quadratic Programming
Philip Wolfe · Econometrica · 1960
A computational procedure is given for finding the minimum of a quadratic function of variables subject to linear inequality constraints.The procedure is analogous to the Simplex Method for linear programming, being based on the Barankin-Dorfman procedure for this problem.
Cited by 503 works. doi:10.2307/1905320
Authors
References
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Nonlinear Programming
- An algorithm for quadratic programming
- The optimization of a quadratic function subject to linear constraints
- On Minimizing a Convex Function Subject to Linear Inequalities
- A quadratic programming procedure
- 4. Theory of Linear Programming
- Quadratic Programming