Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing (Q5219701): Difference between revisions

Latest revision as of 01:47, 22 July 2024

scientific article; zbMATH DE number 7179913

Language	Label	Description	Also known as
English	Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing	scientific article; zbMATH DE number 7179913

Statements

instance of

scholarly article

0 references

title

Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing (English)

0 references

0 references

0 references

Mathematics of Operations Research

0 references

publication date

12 March 2020

0 references

full work available at URL

https://arxiv.org/abs/1703.00744

0 references

https://ir.cwi.nl/pub/28065

0 references

zbMATH Keywords

polynomial optimization

0 references

semidefinite optimization

0 references

Lasserre hierarchy

0 references

simulated annealing

0 references

describes a project that uses

Chebfun

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization

0 references

Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization

0 references

Bound-Constrained Polynomial Optimization Using Only Elementary Calculations

0 references

Simulated Annealing for Convex Optimization

0 references

Optimization by Simulated Annealing

0 references

Global Optimization with Polynomials and the Problem of Moments

0 references

A New Look at Nonnegativity on Closed Sets and Polynomial Optimization

0 references

Q3601990

0 references

Hit-and-run mixes fast

0 references

Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions

0 references

Introduction to Stochastic Search and Optimization

0 references

Identifiers

zbMATH Open document ID

1440.90044

0 references

DOI

10.1287/moor.2017.0906

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5219701

@@ Property / describes a project that uses @@
+Chebfun
@@ Property / describes a project that uses: Chebfun / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2592668180
@@ Property / OpenAlex ID: W2592668180 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q56874472
@@ Property / Wikidata QID: Q56874472 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00744
@@ Property / arXiv ID: 1703.00744 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization
+Normal rank
@@ Property / cites work @@
+Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
+Normal rank
@@ Property / cites work @@
+Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
+Normal rank
@@ Property / cites work @@
+Simulated Annealing for Convex Optimization
@@ Property / cites work: Simulated Annealing for Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Global Optimization with Polynomials and the Problem of Moments
+Normal rank
@@ Property / cites work @@
+A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
+Normal rank
@@ Property / cites work @@
+Q3601990
@@ Property / cites work: Q3601990 / rank @@
+Normal rank
@@ Property / cites work @@
+Hit-and-run mixes fast
@@ Property / cites work: Hit-and-run mixes fast / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
+Normal rank
@@ Property / cites work @@
+Introduction to Stochastic Search and Optimization
+Normal rank