Skip to main content
SpringerLink
Log in

Semidefinite programming

  • Foreword
  • Published:
Mathematical Programming Submit manuscript

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

References

  1. F. Alizadeh, Combinatorial optimization with interior point methods and semidefinite matrices, PhD thesis, University of Minnesota, 1991.

  2. R. Bellman and K. Fan, On systems of linear inequalities in Hermitian matrix variables, in:Proceedings of Symposia in Pure Mathematics, Vol 7 (AMS, 1963).

  3. S. Boyd, L. El Ghaoui, E. Feron and V. Balakrishnan,Linear Matrix Inequalities in System and Control Theory, Studies in Applied Mathematics 15 (SIAM, Philadelphia, PA, June 1994).

    MATH  Google Scholar 

  4. J. Cullum, W.E. Donath and P. Wolfe, The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices,Mathematical Programming Study 3 (1975) 35–55.

    MathSciNet  Google Scholar 

  5. M. Grötschel, L. Lovász and A. Schrijver,Geometric Algorithms and Combinatorial Optimization. (Springer Verlag, Berlin, 1988).

    MATH  Google Scholar 

  6. O. Guler and L. Tuncel, Characterization of the barrier parameter of homogeneous convex cones, Technical Report CORR 95-14, Department of Combinatorics and Optimization, Waterloo, Ont, 1995; to appear inMathematical Programming.

    Google Scholar 

  7. A.S. Lewis and M.L. Overton, Eigenvalue optimization,Acta Numerica 7 (1996) 149–190.

    Article  MathSciNet  Google Scholar 

  8. L. Lovász and A. Schrijver, Cones of matrices and set-functions and 0–1 optimization,SIAM Journal on Optimization 1 (2) (1991) 166–190.

    Article  MATH  MathSciNet  Google Scholar 

  9. Y.E. Nesterov and A.S. Nemirovskii,Interior Point Polynomial Algorithms in Convex Programming (SIAM, Philadelphia, PA, 1994).

    MATH  Google Scholar 

  10. P. Pardalos, F. Rendl and H. Wolkowicz, “Survey of semidefinite relaxations for discrete optimization” in:Topics in Semidefinite and Interior-Point Methods, The Fields Institute for Research in Mathematical Sciences, Communications Series (American Mathematical Society, Providence, RI, to appear).

  11. L. Vandenberghe and S. Boyd, Semidefinite programming,SIAM Review 38 (1996) 49–95.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Courant Institute of Mathematical Sciences, New York University, New York, NY, USA

    Michael Overton

  2. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada

    Henry Wolkowicz

Authors
  1. Michael Overton
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henry Wolkowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Overton, M., Wolkowicz, H. Semidefinite programming. Mathematical Programming 77, 105–109 (1997). https://doi.org/10.1007/BF02614431

Download citation

  • Issue Date:

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

Search

Navigation