Skip to main content
Log in

On the convergence of Han's method for convex programming with quadratic objective

  • Published:
Mathematical Programming Submit manuscript


We present an iterative method for minimizing strictly convex quadratic functions over the intersection of a finite number of convex sets. The method consists in computing projections onto the individual sets simultaneously and the new iterate is a convex combination of those projections. We give convergence proofs even for the inconsistent case, i.e. when the intersection of the sets is empty.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others


  1. W. Cheney and A.A. Goldstein, “Proximity maps for convex sets,”Proceedings of the American Mathematical Society 10(3) (1959) 448–450.

    Google Scholar 

  2. A.R. De Pierro and A.N. Iusem, “A parallel projection method of finding a common point of a family of convex sets,”Pesquisa Operacional 5(1) (1985) 1–20.

    Google Scholar 

  3. A.R. De Pierro and A.N. Iusem, “A simultaneous projections method for linear inequalities,”Linear Algebra and its Applications 64 (1985) 243–253.

    Google Scholar 

  4. S.D. Flåm and J. Zowe, “Relaxed outer projections, weighted averages and convex feasibility,” to be published.

  5. D. Gabay, “Application of the method of multipliers to variational inequalities,” in: M. Fortin and R. Glowinski, eds.,Augmented Lagrangian Methods: Application to the Solution of Boundary-Valued Problems (North-Holland, Amsterdam, 1983) pp. 299–331.

    Google Scholar 

  6. L.G. Gubin, B.T. Polyak and E.V. Raik, “The method of projections for finding the common point of convex sets,”USSR Computational Mathematics and Mathematical Physics 7 (1967) 1–24.

    Google Scholar 

  7. S.P. Han, “A successive projection method,”Mathematical Programming 40 (1988) 1–14.

    Google Scholar 

  8. S.P. Han and G. Lou, “A parallel algorithm for a class of convex programs,”SIAM Journal on Control and Optimization 26(2) (1988) 345–355.

    Google Scholar 

  9. C. Hildreth, “A quadratic programming procedure,”Naval Research Logistics Quarterly 4 (1957) 79–85. [Erratumibid. p. 361.]

    Google Scholar 

  10. A.N. Iusem and A.R. De Pierro, “On the set of weighted least squares solutions of systems of convex inequalities,”Comentationes Mathematicae Universitatis Carolinae 25(4) (1984) 667–678.

    Google Scholar 

  11. A.N. Iusem and A.R. De Pierro, “Convergence results for an accelerated nonlinear Cimmino algorithm,”Numerische Mathematik 49 (1986) 367–378.

    Google Scholar 

  12. A.N. Iusem and A.R. De Pierro, “A simultaneous iterative method for computing projections on polyhedra,”SIAM Journal on Control and Optimization 25(1) (1987) 231–243.

    Google Scholar 

  13. A. Lent and Y. Censor, “Extensions of Hildreth's row-action method for quadratic programming,”SIAM Journal on Control and Optimization 18(4) (1980) 444–454.

    Google Scholar 

  14. G. Pierra, “Decomposition through formalization in a product space,”Mathematical Programming 28 (1984) 96–115.

    Google Scholar 

  15. R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations


Additional information

Work of this author was partially supported by CNPq under grant No. 301280/86-MA.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Iusem, A.N., De Pierro, A.R. On the convergence of Han's method for convex programming with quadratic objective. Mathematical Programming 52, 265–284 (1991).

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI:

Key words