Skip to main content

Parallel Solution of Large Scale Quadratic Programs

  • Chapter

Part of the book series: Applied Optimization ((APOP,volume 24))

Abstract

We consider the solution of large and sparse linearly constrained quadratic programming problems. We describe an iterative scheme that requires to solve at each iteration a linear complementarity problem. For the solution of this last problem we examine parallel iterative solvers based on splittings of the complementarity matrix. We report the numerical results obtained by solving with the proposed approach quadratic programs on Cray T3E.

This work was supported by MURST Project “Numerical Analysis: Methods and Mathematical Software,by CNR Research Contribution N 97.00933.CT01 and by CINECA Project on Parallel Computing, Italy.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benassi M., White R.E.; Parallel numerical solution of variational inequalities, SIAM J. Numer. Anal. 31 (1994), 813 - 830.

    Article  MathSciNet  MATH  Google Scholar 

  2. Bertsekas D.P., Tsitsiklis J.N.; Parallel and Distributed Computation, Numerical Methods, Prentice-Hall, Englewood Cliffs, 1989.

    MATH  Google Scholar 

  3. Boggs P.T., Tolle J.W.; Sequential quadratic programming, Acta Numerica (1995), 1-51. (eds. J.C. Mason, M.G. Cox ), Clarendon Press, Oxford, (1987) 5 - 20.

    Google Scholar 

  4. Bunch J.R., Parlett B.N.; Direct methods for solving symmetric indefinite systems of linear equations, SIAM J. Numer. Anal. 8 (1971), 639 - 655.

    Article  MathSciNet  Google Scholar 

  5. Cottle R.W., Pang J.S., Stone R.E.; The Linear Complementarity Problem, Academic Press, San Diego, 1992.

    MATH  Google Scholar 

  6. CRAY T3E Fortran Optimization Guide, Cray Research Inc., SG-2518, 1996.

    Google Scholar 

  7. Cryer C.W.; The solution of a quadratic programming problem using systematic overtaxation SIAM J. Control 9 (1971), 385-392.

    Google Scholar 

  8. De Pierro A.R., Iusem A.N.; Convergence properties of iterative methods for symmetric positive semidefinite linear complementarity problems, Math. Oper. Res. 18 (1993), 317 - 333.

    Article  MathSciNet  MATH  Google Scholar 

  9. Dyn N., Ferguson J.; The Numerical Solution of Equality-Constrained Quadratic Programming Problems, Math. Comp. 41 (1983), 165 - 170.

    MathSciNet  MATH  Google Scholar 

  10. Fletcher R.; Practical Methods of Optimization, John Wiley, Chichester, 1987.

    MATH  Google Scholar 

  11. Fukushima M.; Equivalent differentiate optimization problems and descent methods for asymmetric variational inequality problems, Math. Programming 53 (1992), 99-110.

    Google Scholar 

  12. Galligani E.; C1 surface interpolation with constraints, Numerical Algorithms 5 (1993), 549-555.

    Google Scholar 

  13. Galligani E., Ruggiero V., Zanni L.; Splitting methods for quadratic optimization in data analysis, Intern. J. Computer Math. 63 (1997), 289 - 307.

    MathSciNet  Google Scholar 

  14. Galligani E., Ruggiero V., Zanni L.; Splitting methods for constrained quadratic programs in data analysis, Computers Math. Applic. 32 (1996), 1 - 9.

    Article  MathSciNet  MATH  Google Scholar 

  15. Galligani E., Ruggiero V., Zanni L.; Splitting methods and parallel solution of constrained quadratic programs, Rend. Circ. Matem. Palermo Ser. II Suppl. 48 (1997), 121 - 136.

    MathSciNet  Google Scholar 

  16. Goldfarb D., Idnani A.; A numerically stable dual method for solving strictly convex quadratic programs, Math. Programming 27 (1983), 1 - 33.

    Article  MathSciNet  MATH  Google Scholar 

  17. Lin Y.Y., Pang J.S.; Iterative methods for large convex quadratic programs: a survey, SIAM J. Control Optim. 25 (1987), 383 - 411.

    Article  MATH  Google Scholar 

  18. Luenberger D.G.; Linear and Nonlinear Programming, Addison-Wesley, Reading, 1984.

    MATH  Google Scholar 

  19. Luo Z.Q., Tseng P.; On the convergence of a matrix-splitting algorithm for the symmetric monotone linear complementarity problem, SIAM J. Control Optim. 29 (1991), 1037 - 1060.

    Article  MATH  Google Scholar 

  20. Luo Z.Q., Tseng P.; On the linear convergence of descent methods for convex essentially smooth minimization, SIAM J. Control Optim. 30 (1992), 408 - 425.

    Article  MATH  Google Scholar 

  21. Luo Z.Q., Tseng P.; Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem, SIAM J. Optimization 2 (1992), 43 - 54.

    Article  MATH  Google Scholar 

  22. Mangasarian O.L.; Solution of symmetric linear complementarity problems by iterative methods, J. Optim. Theory Appl. 22 (1977), 465-485.

    Google Scholar 

  23. Mangasarian O.L., De Leone R.; Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs, J. Optim. Theory Appl. 54 (1987), 437 - 446.

    Article  MathSciNet  MATH  Google Scholar 

  24. Mangasarian O.L., De Leone R.; Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs, Ann. Oper. Res. 14 (1988), 41 - 59.

    Article  MathSciNet  MATH  Google Scholar 

  25. Ortega J.M.; Numerical Analysis: A Second Course, Academic Press, New York, 1972.

    MATH  Google Scholar 

  26. Ortega J.M., Rheinboldt W.C.; Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.

    MATH  Google Scholar 

  27. Pang J.S., Chan D.; Iterative methods for variational and complementarity problems, Math. Programming, 24 (1982), 284 - 313.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Kluwer Academic Publishers, Boston

About this chapter

Cite this chapter

Galligani, E., Ruggiero, V., Zanni, L. (1998). Parallel Solution of Large Scale Quadratic Programs. In: De Leone, R., Murli, A., Pardalos, P.M., Toraldo, G. (eds) High Performance Algorithms and Software in Nonlinear Optimization. Applied Optimization, vol 24. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3279-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-3279-4_13

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-3281-7

  • Online ISBN: 978-1-4613-3279-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics