Skip to main content
SpringerLink
Log in

Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs

  • Published:
Mathematical Programming Submit manuscript

Abstract

The author (1992, 1993) earlier studied the equivalence of a class of 0–1 quadratic programs and their relaxed problems. Thus, a class of combinatorial optimization problems can be solved by solving a class of nonconvex quadratic programs. In this paper, a necessary and sufficient condition for local minima of this class of nonconvex quadratic programs is given; this will be the foundation for study of algorithms.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.-M. Cao, “The equivalence of a class of combinatorial optimization problems and nonconvex quadratic programming,”Journal of Southwest Jiaotong University 1 (1993) 72–78.

    Google Scholar 

  2. J.-M. Cao, “The relaxed properties for a class of combinatorial optimization model in the sense of local optimization,” in:OR and Decision Making (Press of Chengdu Science Technology University, 1992) 142–148.

  3. L. Contesse, “Une caractérisation complète des minima locaux en programmation quadratique,”Numerische Mathematik 34 (1980) 315–332.

    Google Scholar 

  4. O.L. Mangasarian, “Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems,”Mathematical Programming 19 (1980) 200–212.

    Google Scholar 

  5. J.J. Moré and S.A. Vavasis, “On the solution of concave knapsack problems,”Mathematical Programming 49 (1991) 397–411.

    Google Scholar 

  6. K.G. Murty and S.N. Kabadi, “Some NP-complete problems in quadratic and nonlinear programming,”Mathematical Programming 39 (1987) 117–129.

    Google Scholar 

  7. P.M. Pardalos and J.B. Rosen,Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Science 268 (Springer, Berlin 1987).

    Google Scholar 

  8. P.M. Pardalos and G. Schnitger, “Checking local optimality in constrained quadratic programming is NP-hard,”Operations Research Letters 7 (1988) 33–35.

    Google Scholar 

  9. P.M. Pardalos and S. Vavasis, “Open questions in complexity theory for numerical optimization,”Mathematical Programming 57 (1992) 337–339.

    Google Scholar 

  10. P.M. Pardalos and S. Vavasis, “Quadratic programming with one negative eigenvalue is NP-hard,”Journal of Global Optimization 1 (1991) 15–22.

    Google Scholar 

  11. S.A. Vavasis, “Local minima for indefinite quadratic knapsack problems,”Mathematical Programming 54 (1992) 127–153.

    Google Scholar 

  12. S.A. Vavasis,Nonlinear Optimization—Complexity Issues (Oxford University Press, Oxford, 1991).

    Google Scholar 

Download references

Author information

Author notes

  1. Jia-Ming Cao

    Present address: Institute of Transportation Studies, University of California, 108 Naval Architecture Building, 94720, Berkeley, CA, United States

Authors and Affiliations

  1. Department of Transportation Engineering, Southwest Jiaotong University, 610031, Chengdu, Sichuan, China

    Jia-Ming Cao

Authors
  1. Jia-Ming Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by Huo Yingdong Educational Foundation '93.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cao, JM. Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs. Mathematical Programming 69, 403–411 (1995). https://doi.org/10.1007/BF01585567

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01585567

Keywords

Search

Navigation