A method for solving certain quadratic programming problems arising in nonsmooth optimization

IMA Journal of Numerical Analysis

Volumn 6, Issue 2, 1986, Pages 137-152

  Kiwiel, Krzysztof C ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001260166     PISSN: 02724979     EISSN: None     Source Type: Journal    
DOI: 10.1093/imanum/6.2.137     Document Type: Article

References (24)

1. Best, M. J. 1984 Equivalence of some quadratic programming algorithms. Math. Programming 30, 71-87.
2. Best, M. J., & Ritter, K. 1976 An effective algorithm for quadratic minimization problems. MRC Technical Summary Report No. 1961, University of Wisconsin.
3. Daniel, J. W., Gragg, W. B., Kaufman, L., & Stewart, G. W. 1976 Re-orthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comp. 30, 772-792.
4. Dantzig, G. B. 1963 Linear Programming and Extensions. Princeton, NJ: Princeton University Press.
5. Fletcher, R. 1971 A general quadratic programming algorithm. J. Inst. Math. Appl. 7, 76-91.
6. Fletcher, R. 1981 Practical Methods of Optimization II: Constrained Optimization. New York: Wiley.
7. Gill, P. E., Golub, G. H., Murray, W., & Saunders, M. A. 1974 Methods for modifying matrix factorizations. Math. Comp. 28, 505-535.
8. Gill, P. E., & Murray, W. 1978 Numerically stable methods for quadratic programming. Math. Programming 14, 349-372.
9. Gill, P. E., Murray, W., & Wright, M. H. 1981 Practical Optimization. London: Academic Press.
10. Kiwiel, K. C. 1983 An aggregate subgradient method for nonsmooth convex minimization. Math. Programming 27, 320-341.
11. Kiwiel, K. C. 1985 Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics 1133. Berlin: Springer-Verlag.
12. Lemarechal, C. 1977 Nonsmooth optimization and descent methods. RR. 78-4, International Institute for Applied Systems Analysis, Laxenburg, Austria.
13. Mifflin, R. 1979 A stable method for solving certain constrained least squares problems. Math. Programming 16, 141-158.
14. Mifflin, R. 1982 A modification and an extension of Lemaréchal’s algorithm for nonsmooth minimization. In Nondifferential and Variational Techniques in Optimization (Sorensen, D. C. & Wets, R. J. B. Eds), Mathematical Programming Study 17, pp. 77-90. Amsterdam: North-Holland.
15. Pang, J. C. 1981 An equivalence between two algorithms for quadratic programming. Math. Programming 20, 152-165.
16. Powell, M. J. D. 1981 An upper triangular matrix method for quadratic programming. In Nonlinear Programming 4 (Mangasarian, O. L., Meyer, R. R., & Robinson, S. M., Eds.), pp. 1-24, New York: Academic Press.
17. Seber, G. A. F. 1977 Linear Regression Analysis. New York: Wiley.
18. Stoer, J. 1971 On the numerical solution of constrained least squares problems. SIAM J. _numer. Anal. 8, 382-411.
19. Schittkowski, K. 1983 The numerical solution of constrained least squares problems. IMA J. numer. Anal. 3, 11-36.
20. Schittkowski, K., & Stoer, J. 1979 A factorization method for constrained least squares problems with data changes. Numer. Math. 31, 431-463.
21. Stewart, G. W. 1984 Rank degeneracy. SIAM J. sci. stat. Comput. 5, 403-413.
22. Van de Panne, C., & Whinston, A. 1969 The symmetric formulation of the simplex method for quadratic programming. Econometrica 37, 507-527.
23. Wierzbicki, A. P. 1982 Lagrangian functions in nondifferentiable optimization. In Progress in Nondifferentiable Optimization (Nurminski, E. A., Ed.), pp. 173-213. CP-82-S8, International Institute for Applied Systems Analysis, Laxenburg, Austria.
24. Wolfe, P. 1976 Finding the nearest point in a polytope. Math. Programming 11, 128-149.