The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi
Abstract
GloptiPoly is a Matlab/SeDuMi add-on to build and solve convex linear matrix inequality relaxations of the (generally nonconvex) global optimization problem of minimizing a multivariable polynomial function subject to polynomial inequality, equality, or integer constraints. It generates a series of lower bounds monotonically converging to the global optimum without any problem splitting. Global optimality is detected and isolated optimal solutions are extracted automatically. Numerical experiments show that for most of the small-scale problems described in the literature, the global optimum is reached at low computational cost.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Global Optimization with Polynomials and the Problem of Moments
Lasserre, J. B. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623400366802 · Cited by 2,474
Self-citationStructured semidefinite programs and semialgebraic geometry methods in robustness and optimization
Parrilo, P. A. (2000) · doi:10.7907/2k6y-ch43 · Cited by 1,802
Semidefinite programming relaxations for semialgebraic problems
Parrilo, P. A. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0387-5 · Cited by 1,527
Sherali, H. D., & Adams, W. P. (1990) · SIAM Journal on Discrete Mathematics · doi:10.1137/0403036 · Cited by 931
Zimmermann, H. (1979) · European Journal of Operational Research · doi:10.1016/0377-2217(79)90240-6 · Cited by 698
Handbook of Test Problems in Local and Global Optimization
Floudas, C. A., Pardalos, P. M., Adjiman, C. S., Esposito, W. R., Gümüş, Z. H., Harding, S. T., Klepeis, J. L., Meyer, C. A., & Schweiger, C. A. (1999) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-3040-1 · Cited by 636
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91233-6 · Cited by 591
Cited by
YALMIP : a toolbox for modeling and optimization in MATLAB
Lofberg, J. (2005) · 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) · doi:10.1109/cacsd.2004.1393890 · Cited by 9,149
Sums of Squares, Moment Matrices and Optimization Over Polynomials
Laurent, M. (2009) · The IMA Volumes in Mathematics and its Applications · doi:10.1007/978-0-387-09686-5_7 · Cited by 648
Introducing SOSTOOLS: a general purpose sum of squares programming solver
Prajna, S., Papachristodoulou, A., & Parrilo, P. A. (2003) · Proceedings of the 41st IEEE Conference on Decision and Control, 2002. · doi:10.1109/cdc.2002.1184594 · Cited by 545
Waki, H., Kim, S., Kojima, M., & Muramatsu, M. (2006) · SIAM Journal on Optimization · doi:10.1137/050623802 · Cited by 439
Complete search in continuous global optimization and constraint satisfaction
Neumaier, A. (2004) · Acta Numerica · doi:10.1017/s0962492904000194 · Cited by 430
Metadata
- Authors
- Henrion, D., & Lasserre, J.-B.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2003-06
- Volume
- 29
- Issue
- 2
- Pages
- 165-194
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2001033871
- Cited by
- 369
- References
- 17
- FWCI
- 26.36
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. https://app.cochat.ai/papers/10.1145/779359.779363
- The paper
- Henrion, D., & Lasserre, J.-B. (2003). GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. ACM Transactions on Mathematical Software. https://doi.org/10.1145/779359.779363
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.