Monique Laurent  Home/Search
Context Related
| homepages.cwi.nl/~monique...idealcor.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: homepages.cwi.nl/~monique/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a concise semidefinite formulation for the problem of minimizing a polynomial over a semi-algebraic set defined by polynomial equalities and inequalities. (Update)
Cited by: More
Revisiting Two Theorems of Curto and Fialkow on Moment Matrices - Laurent (2004) (Correct)
Converging Semidefinite Bounds for Global Unconstrained.. - Jibetean, Laurent (2004) (Correct)
Active bibliography (related documents): More All
2.4: Semidefinite Representations for Finite Varieties - Laurent (2004) (Correct)
0.6: Subset Algebra Lift Operators for 0-1 Integer Programming - Bienstock, Zuckerberg (2002) (Correct)
0.6: A Comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre.. - Laurent (2001) (Correct)
Similar documents based on text: More All
0.3: A Comparison of the Sherali-Adams, Lovasz-Schrijver and .. - Programming Monique.. (Correct)
0.3: Matrix Completion Problems - Laurent (2001) (Correct)
0.2: Semidefinite Programming and Integer Programming - Monique Laurent And (Correct)
Related documents from co-citation: More All
2: Semidefinite programming relaxations for semialgebraic problems - Parrilo - 2001
2: Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustnes.. - Parrilo - 2000
2: Gloptipoly - global optimization over polynomials with matlab and sedumi - Henrion, Lasserre - 2002
BibTeX entry: (Update)
M. Laurent. Semidefinite representations for finite varieties. Preprint, 2002. http://citeseer.ist.psu.edu/laurent03semidefinite.html More
@misc{ laurent02semidefinite,
author = "M. Laurent",
title = "Semidefinite representations for finite varieties",
text = "M. Laurent. Semidefinite representations for finite varieties. Preprint,
2002.",
year = "2002",
url = "citeseer.ist.psu.edu/laurent03semidefinite.html" }
Citations (may not include all citations):117 A lift-and-project cutting plane algorithm for mixed 0-1 pro.. (context) - Balas, Ceria et al. - 1993
104 and Algorithms: An Introduction to Computational Algebraic G.. (context) - Cox, Little et al. - 1997
93 IEEE Transactions on Information Theory (context) - Lovasz, Shannon et al. - 1979
51 Global optimization with polynomials and the problem of mome.. - Lasserre - 2001
50 A hierarchy of relaxations between the continuous and convex.. (context) - Sherali, Adams - 1990
40 Structured semidefinite programs and semialgebraic geometry .. - Parrilo - 2000
39 Transactions of the American Mathematical Society (context) - Curto, Fialkow et al. - 2000
37 Squared functional systems and optimization problems (context) - Nesterov - 2000
30 Positive polynomials on compact semi-algebraic sets (context) - Putinar - 1993
27 Cones of matrices and set-functions and 0-1 optimization (context) - Lovasz, Schrijver - 1991
27 moment problem for compact semi-algebraic sets (context) - Schmudgen - 1991
27 Semidefinite programming relaxations for semialgebraic probl.. - Parrilo - 2002
9 Lovasz-Schrijver and Lasserre relaxations for 0-1 programmin.. (context) - Laurent, of et al. - 2001
6 Maximum stable set formulations and heuristics based on cont.. - Burer, Monteiro et al. - 2000
6 An explicit exact SDP relaxation for nonlinear 0 1 programs (context) - Lasserre - 2001
5 Distinguished representations of strictly positive polynomia.. (context) - Jacobi, Prestel - 2001
5 Solution of the truncated complex moment problem for flat da.. (context) - Curto, Fialkow - 1996
4 An approach to obtaining global extremums in polynomial math.. (context) - Shor - 1987
3 Lower bound for the number of iterations in semidefinite rel.. (context) - Laurent - 2002
3 Rank-two heuristics for max-cut and other binary quadratic p.. (context) - Burer, Monteiro et al. - 2002
3 An explicit construction of distinguished representations of.. - Parrilo - 2002
3 Polynomials nonnegative on a grid and discrete representatio.. (context) - Lasserre - 2001
1 To appear in The Sharpest Cut (context) - Laurent, for et al. - 2001
Documents on the same site (http://homepages.cwi.nl/~monique/): More
Semidefinite Programming and Integer Programming - Laurent, Rendl (Correct)
Lower Bound for the Number of Iterations in Semidefinite.. - Laurent (2002) (Correct)
Semidefinite Relaxations for Max-Cut - Laurent (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC