Skip to main content
SpringerLink
Log in
SpringerLink
Log in

An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2081))

Abstract

We consider the general nonlinear optimization problem in 0- 1 variables and provide an explicit equivalent convex positive semidefinite program in 2n - 1 variables. The optimal values of both problems are identical. From every optimal solution of the former one easily find an optimal solution of the latter and conversely, from every solution of the latter one may construct an optimal solution of the former.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Curto, R.E., Fialkow, L.A.: The truncated complex K-moment problem. Trans. Amer. Math. Soc. 352 (2000) 2825–2855.

    Article  MATH  MathSciNet  Google Scholar 

  2. Jacobi, T., Prestel, A.: On special representations of strictly positive polynomials. Technical-report, Konstanz University, Germany (2000).

    Google Scholar 

  3. Kojima, M., Tunçel, L.: Cones of matrices and successive convex relaxations of non convex sets. SIAM J. Optim. 10 (2000) 750–778.

    Article  MATH  MathSciNet  Google Scholar 

  4. Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11 (2001) 796–817.

    Article  MATH  MathSciNet  Google Scholar 

  5. Lasserre, J.B.: Optimality conditions and LMI relaxations for 0-1 programs. Technical report #00099, LAAS-CNRS Toulouse, France (2000).

    Google Scholar 

  6. Lasserre, J.B.: New LMI relaxations for the general nonconvex quadratic problem. In: Advances in Convex Analysis and Global Optimization, Eds: N. Hadjisavvas and P.M. Pardalos, Kluwer Academic Publishers, 2001.

    Google Scholar 

  7. Lovász, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1 (1991) 166–190.

    Article  MATH  MathSciNet  Google Scholar 

  8. Putinar, M.: Positive polynomials on compact semi-algebraic sets. Ind. Univ. Math.J. 42 (1993) 969–984.

    Article  MATH  MathSciNet  Google Scholar 

  9. Schmüdgen, K.: The K-moment problem for compact semi-algebraic sets. Math. Ann. 289 (1991) 203–206.

    Article  MATH  MathSciNet  Google Scholar 

  10. Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programmimg problems. SIAM J.Disc. Math. 3 (1990) 411–430.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAAS-CNRS, 7 Avenue du Colonel Roche, 31077, Toulouse Cédex, France

    Jean B. Lasserre

Authors
  1. Jean B. Lasserre
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituut voor Informatica en Informatiekunde, Universiteit Utrecht, Padualaan 14, 3584, CH Utrecht, The Netherlands

    Karen Aardal

  2. CWI, Kruislaan 413, 1098, SJ Amsterdam, The Netherlands

    Bert Gerards

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lasserre, J.B. (2001). An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs. In: Aardal, K., Gerards, B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2001. Lecture Notes in Computer Science, vol 2081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45535-3_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45535-3_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42225-9

  • Online ISBN: 978-3-540-45535-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation