Splitting methods for quadratic optimization in data analysis

International Journal of Computer Mathematics

Volumn 63, Issue 3-4, 1997, Pages 289-307

  Galligani, E ^a   Ruggiero, V ^a   Zanni, L ^a  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

Bivariate interpolation; Diagonalization method; Large scale problem; Linearly constrained strictly convex quadratic program; Splitting method; Vector computer

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; INTERPOLATION; ITERATIVE METHODS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING;

DIAGONALIZATION ALGORITHMS (DA); SPLITTING ALGORITHMS (SA);

DATA REDUCTION;

EID: 0030676954     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169708804568     Document Type: Article

References (30)

1. Akima, H. (1978). A method of bivariate interpolation smooth surface fitting for irregularly distributed data points, ACM Trans. Math. Software, 4, 148-159.
2. Anderson, E. et al. (1992). LAPACK User's Guide, SIAM Philadelphia.
3. Barnhill, R.E., Birkhoff G. and Gordon, W.J. (1973). Smooth interpolation in triangles, J. Approx. Theory. 8, 114-128.
4. Barnhill, R.E. and Gregory, J.A. (1975). Compatible smooth interpolation in triangles, J. Approx. Theory, 15, 214-225.
5. Bunch, J.R. and Parlett, B.N. (1971). Direct methods for solving symmetric indefinite systems of linear equations, SIAM J. Numerical Anal., 8, 639-655.
6. Cottle, R.W., Pang, J.S. and Stone, R.E. (1992). The Linear Complementarity Problem, Academic Press, San Diego.
7. Cryer, C.W. (1971). The solution of a quadratic programming problem using systematic overlaxation, SIAM J. Control, 9, 385-392.
8. De Leone, R. and Mangasarian, O.L (1988). Asyncronous parallel successive overrelaxation for the symmetric linear complementarity problem, Math. Programming, 42, 347-361.
9. De Pierro, A.R. and Iusem, A.N. (1993). Convergence properties of iterative methods for symmetric positive semidefinite linear complementarity problems, Math. Oper. Res., 18, 317-333.
10. De Pierro, A.R. and Lópes, J.M. (1994). Accelerating iterative algorithms for symmetric linear complementarity problems, Intern. J. Computer Math., 50, 35-44.
11. Dyn, N. and Ferguson, W.E. (1983). The numerical solution of equality-constrained quadratic programming problems, Math. Comp., 41 (163), 165-170.
12. Fletcher, R. (1987). Practical Methods of Optimization, John Wiley, Chichester.
13. 1 surface interpolation with constraints, Numerical Algorithms, 5, 549-555.
14. Galligani, E. and Zanni, L. (1996). Error analysis of elimination methods for equality constrained quadratic programming problems, Numerical Methods and Error Bounds, Mathematical Research, 89, (Eds Alefeld, G. and Herzberger, J.), Akademie Verlag, Berlin 107-112.
15. Galligani, I., Loli Piccolomini, E. and Ruggiero, V. (1992). Numerical solution of the image restoration problem on a multivector computer, Parallel Computing: Problems, Methods and Applications (Eds Messina, P. and Murli, A.), Elsevier Science Publishers B.V. Amsterdam, 183-187.
16. Galligani, I., Loli Piccolomini, E., Ruggiero, V. and Zama, F. (1994). A substructuring method for solving the image restoration problem on a multiprocessor sytem, Proceedings of SMS 94 TPE, Moscow 435-444.
17. Galligani, I. and Ruggiero, V. (1993). Numerical solution of equality-constrained quadratic programming problem on vector-parallel computers, Optimization Methods & Software, 2, 233-247.
18. Gill, P.E. and Murray, W. (1974). Newton type methods for linearly constrained optimization, Numerical Methods for Constrained Optimization (Eds Gill, P.E. and Murray, W.), Academic Press, London.
19. Gill, P.E. and Murray, W. (1978). Modification of matrix factorization after a rank-one chance, The State of the Art in Numerical Analysis (Ed. Jacobs, D.A.H.), Academic Press, London.
20. Gill, P.E., Murray, W., Saunders, M.A. and Wright, M.H. (1984). Sparse matrix methods in optimization, SIAM J. Sci. Stat. Comp., 5, 562-589.
21. Goldfarb, D. and Idnani, A. (1983). A numerically stable dual method for solving strictly convex quadratic programs, Math. Programming, 27, 1-33.
22. 1 interpolant to arbitrarily spaced data, Comput. Graph. Image Process. 8, 92-112.
23. 1 surface interpolation, Mathematical Software III (Ed. J. R. Rice), Academic Press, New York.
24. Lin, Y.Y. and Pang, J.S. (1987). Iterative methods for large convex quadratic programs: a survey, SIAM J. Control Optim., 25, 383-411.
25. Loli Piccolomini, E., Ruggiero, V. and Zama, F. (1994). A domain decomposition method for scattered data approximation on a multiprocessor system, Parallel Computing: Trends and Applications (Eds Evans, D.J., Joubert, G.R., Peters, F. J. and Trystram, D.), Elsevier Science Publishers B. V. Amsterdam, 193-200.
26. Luo, Z.Q. and Tseng, P. (1992). Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem, SIAM J. Optimization, 2, 43-54.
27. Mangasarian, O.L. (1991). Convergence of iterates of an inexact matrix splitting algorithm for the symmetric monotone linear complementarity problems, SIAM J. Control Optim., 1, 114-122.
28. Mangasarian, O.L. and De Leone, R. (1987). Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs, J. Optim. Theory Appl., 54, 437-446.
29. Medhi, K.T. (1994). A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem, Math. Programming, 65, 365-380.
30. Nielson, G.M. (1983). A method for interpolating scattered data based upon a minimum norm network, Math. Comp., 40, 253-271.