Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference7 articles.
1. M. S. Bazana, J. J. Goode and R. L. Rardin,An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality, Journal of Mathematical Analysis and Applications 65 (1978), 278–288.
2. R. Fletcher,A general quadratic programming algorithm, J. Inst. Maths. Applics. 7 (1971), 76–91.
3. R. Mifflin,A stable method for solving certain constrained least squares problems, Mathematical programming 16 (1979), 141–158.
4. S. Storøy,An efficient least distance algorithm based on a general quadratic programming method, Report no. 69, Dept of applied mathematics, University of Bergen, 1979.
5. S. Storøy,An algorithm for finding a vector in the intersection of open convex polyhedral cones, BIT 13 (1973), 114–119.