The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Global Optimization with Polynomials and the Problem of Moments
Abstract
We consider the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): {\mathbb{R}}^n\to {\mathbb{R}}$, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear matrix inequality (LMI) problems. A notion of Karush--Kuhn--Tucker polynomials is introduced in a global optimality condition. Some illustrative examples are provided.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
The Moment Problem on Compact Semi-Algebraic Sets
Schmüdgen, K. (2017) · Graduate texts in mathematics · doi:10.1007/978-3-319-64546-9_12 · Cited by 429
Landau, H. J. (1987) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/037 · Cited by 103
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
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981851 · Cited by 2,959
Brunner, N., Cavalcanti, D., Pironio, S., Scarani, V., & Wehner, S. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.419 · Cited by 2,688
Gühne, O., & Tóth, G. (2009) · Physics Reports · doi:10.1016/j.physrep.2009.02.004 · Cited by 2,401
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2008) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000001 · Cited by 1,820
Semidefinite programming relaxations for semialgebraic problems
Parrilo, P. A. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0387-5 · Cited by 1,527
(2014) · Choice Reviews Online · doi:10.5860/choice.51-3296 · Cited by 1,260
The Scenario Approach to Robust Control Design
Calafiore, G. C., & Campi, M. C. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.875041 · Cited by 1,150
Disciplined Convex Programming
Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9_7 · Cited by 1,026
Group Search Optimizer: An Optimization Algorithm Inspired by Animal Searching Behavior
He, S., Wu, Q. H., & Saunders, J. R. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2011992 · Cited by 724
A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
Navascués, M., Pironio, S., & Acín, A. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/7/073013 · Cited by 721
Novel meta-heuristic bald eagle search optimisation algorithm
Alsattar, H. A., Zaidan, A. A., & Zaidan, B. B. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09732-5 · Cited by 681
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
Non-convex mixed-integer nonlinear programming: A survey
Burer, S., & Letchford, A. N. (2012) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2012.08.001 · Cited by 547
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
Convex Relaxation of Optimal Power Flow—Part II: Exactness
Low, S. H. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2323634 · Cited by 523
Frameworks and Results in Distributionally Robust Optimization
Rahimian, H., & Mehrotra, S. (2022) · Open Journal of Mathematical Optimization · doi:10.5802/ojmo.15 · Cited by 506
Hankel Matrix Rank Minimization with Applications to System Identification and Realization
Fazel, M., Pong, T. K., Sun, D., & Tseng, P. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110853996 · Cited by 487
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
Optimal Inequalities in Probability Theory: A Convex Optimization Approach
Bertsimas, D., & Popescu, I. (2005) · SIAM Journal on Optimization · doi:10.1137/s1052623401399903 · Cited by 428
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
Laurent, M. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.3.470.16391 · Cited by 373
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi
Henrion, D., & Lasserre, J.-B. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/779359.779363 · Cited by 369
Self-citationOptimal Linear-Consensus Algorithms: An LQR Perspective
Cao, Y., & Ren, W. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2030495 · Cited by 345
Yang, H., Antonante, P., Tzoumas, V., & Carlone, L. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.2965893 · Cited by 325
Approximation of the Stability Number of a Graph via Copositive Programming
de Klerk, E., & Pasechnik, D. V. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623401383248 · Cited by 322
Nurdin, H. I., James, M. R., & Petersen, I. R. (2009) · Automatica · doi:10.1016/j.automatica.2009.04.018 · Cited by 314
LMI Relaxations in Robust Control
Scherer, C. W. (2006) · European Journal of Control · doi:10.3166/ejc.12.3-29 · Cited by 312
Testing the Dimension of Hilbert Spaces
Brunner, N., Pironio, S., Acin, A., Gisin, N., Méthot, A. A., & Scarani, V. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.210503 · Cited by 304
SE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group
Rosen, D. M., Carlone, L., Bandeira, A. S., & Leonard, J. J. (2019) · The International Journal of Robotics Research · doi:10.1177/0278364918784361 · Cited by 282
Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
Lasserre, J. B. (2006) · SIAM Journal on Optimization · doi:10.1137/05064504x · Cited by 281
Self-citationStrong SOCP Relaxations for the Optimal Power Flow Problem
Kocuk, B., Dey, S. S., & Sun, X. A. (2016) · Operations Research · doi:10.1287/opre.2016.1489 · Cited by 281
A Survey of Relaxations and Approximations of the Power Flow Equations
Molzahn, D. K., & Hiskens, I. A. (2019) · Foundations and Trends® in Electric Energy Systems · doi:10.1561/3100000012 · Cited by 272
Warm-starting quantum optimization
Egger, D. J., Mareček, J., & Woerner, S. (2021) · Quantum · doi:10.22331/q-2021-06-17-479 · Cited by 269
Interior-point methods for optimization
Nemirovski, A. S., & Todd, M. J. (2008) · Acta Numerica · doi:10.1017/s0962492906370018 · Cited by 265
An Introduction to Polynomial and Semi-Algebraic Optimization
Lasserre, J. B. (2015) · Cambridge University Press eBooks · doi:10.1017/cbo9781107447226 · Cited by 260
Self-citationChallenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201
“Similarly, using moment or sum-of-squares techniques 134,135 , MIP can be reformulated to infinite-dimensional linear programming, with an SDP relaxation in a dimension much higher than n + d and sometimes 136 exponential in n + d .”
Classical algorithms and quantum limitations for maximum cut on high-girth graphs
Barak, B., & Marwaha, K. (2021) · arXiv · doi:10.48550/arxiv.2106.05900 · Cited by 19
Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs
Barak, B., & Marwaha, K. (2022) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.itcs.2022.14 · Cited by 19
Learning dynamic polynomial proofs
Fawzi, A., Malinowski, M., Fawzi, H., & Fawzi, O. (2019) · arXiv · doi:10.48550/arxiv.1906.01681 · Cited by 8
Metadata
- Authors
- Lasserre, J. B.
- Venue
- SIAM Journal on Optimization
- Published
- 2001-01
- Volume
- 11
- Issue
- 3
- Pages
- 796-817
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W1967344706
- Cited by
- 2,474
- References
- 3
- FWCI
- 41.65
- 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
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.