Skip to main content
Log in

Ellipsoidal Approach to Box-Constrained Quadratic Problems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We present a new heuristic for the global solution of box constrained quadratic problems, based on the classical results which hold for the minimization of quadratic problems with ellipsoidal constraints. The approach is tested on several problems randomly generated and on graph instances from the DIMACS challenge, medium size instances of the Maximum Clique Problem. The numerical results seem to suggest some effectiveness of the proposed approach.

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

References

  1. J. Abello, S. Butenko, P.M. Pardalos and M.G.C. Resende (2001), Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Global Optimization. 21, 111–137.

    Google Scholar 

  2. A. Beck and M. Teboulle (2000), Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J. Optim. 11, 179–188.

    Google Scholar 

  3. I.M. Bomze, M. Budinich, M. Pelillo and C. Rossi (2001), Annealed replication: A new heuristic for the maximum clique problem, to appear in: Discrete Appl. Math.

  4. I.M. Bomze, M. Budinich, P.M. Pardalos and M. Pelillo (1999), The maximum clique problem. In: D.Z. Du and P.M. Pardalos (Eds), Handbook of Combinatorial Optimization, suppl. Vol. A, 1–74. Kluwer Academic Publishers, Dordrecht.

    Google Scholar 

  5. I.M. Bomze, M. Pelillo and R. Giacomini (1997), Evolutionary approach to the maximum clique problem: Empirical evidence on a larger scale. In: I. M. Bomze, T. Csendes, R. Horst and P. M. Pardalos (Eds.), Developments in Global Optimization, pp. 95–108. Kluwer Academic Publishers, Dordrecht.

    Google Scholar 

  6. G. Danninger and I.M. Bomze (1994), Generalized convexity for second-order optimality conditions. In: S. Komlósi, T. Rapcsák, S. Schaible (Eds.), Generalized Convexity, pp. 137–144. Springer, Berlin.

    Google Scholar 

  7. P.L. De Angelis, P.M. Pardalos and G. Toraldo (1997), Quadratic Programming with box constraints. In: I.M. Bomze, T. Csendes, R. Horst and P.M. Pardalos (Eds.), Developments in Global Optimization, pp. 73–93. Kluwer Academic Publishers, Dordrecht/Boston/London.

    Google Scholar 

  8. L. E. Gibbons, D. W. Hearn and P. M. Pardalos (1996), A continuous based heuristic for the maximum clique problem. In: D. S. Johnson and M. Trick (Eds.), Cliques, Coloring, and Satisfiability—Second DIMACS Implementation Challenge, pp. 103–124. American Mathematical Society, Providence, RI.

    Google Scholar 

  9. J. Hasselberg, P.M. Pardalos and G. Vairaktarakis (1993), Test case generators and computational results for the maximum clique problem, Journal of Global Optimization 3, 463–482.

    Google Scholar 

  10. C.G. Han, P.M. Pardalos and Y. Ye (1992), On the solution of indefinite quadratic problems using an interior point algorithm, Informatica 3, 474–496.

    Google Scholar 

  11. J.B. Hiriart-Urruty (1995), Conditions for global optimality. In: R. Horst and P. M. Pardalos (Eds.), Handbook of Global Optimization, pp. 1–26. Kluwer Academic Publishers, Dordrecht.

    Google Scholar 

  12. M.K. Kozlov, S.P. Tarasov and L.G. Khacian (1979), Polynomial solvability of convex quadratic programming, Soviet. Math. Dokl. 20, 1108–1111.

    Google Scholar 

  13. S. Lucidi, L. Palagi and M. Roma (1998), On some properties of quadratic programs with a convex quadratic constraint, SIAM J. Optim. 8, 105–122.

    Google Scholar 

  14. J.M. Martínez (1994), Local minimizers of quadratic functions on Euclidean balls and spheres, SIAM J. Optim. 4, 159–176.

    Google Scholar 

  15. Matlab-Optimization Tolbox 2.1 (2001), The Math Works, Inc.

  16. A. Neumaier (1992), An optimality criterion for global quadratic optimization, J. Global Optimization 2, 201–208.

    Google Scholar 

  17. J. Moré and D.C. Sorensen (1983), Computing a trust region step, SIAM J. Sci. Stat. Comput. 4, 553–572.

    Google Scholar 

  18. P.M. Pardalos and G.P. Rodgers (1990), Computational aspects of branch and bound algorithms for quadratic zero-one programming, Computing 45, 131–144.

    Google Scholar 

  19. R.J. Stern and H. Wolkowicz (1994), Trust region problems and nonsymmetric eigenvalue perturbations, SIAM J. Matrix Anal. Appl. 15, 755–778.

    Google Scholar 

  20. Y. Yajima, M.V. Ramana and P.M. Pardalos (2001), Cuts and Semidefinite Relaxations for Nonconvex Quadratic Problems, In: N. Hadjisavvas, J.E. Martinez-Legaz and J.P. Penot (Eds.), ‘Generalized Convexity and Generalized Monotonicity,’ Lecture Notes in Economics and Mathematical Systems, Vol. 502, pp. 48–70. Springer, Berlin.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

de Angelis, P.L., Bomze, I.M. & Toraldo, G. Ellipsoidal Approach to Box-Constrained Quadratic Problems. Journal of Global Optimization 28, 1–15 (2004). https://doi.org/10.1023/B:JOGO.0000006654.34226.fe

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JOGO.0000006654.34226.fe

Navigation