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

From MaRDI portal
Created claim: Wikidata QID (P12): Q56874472, #quickstatements; #temporary_batch_1711196317277
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1703.00744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bound-Constrained Polynomial Optimization Using Only Elementary Calculations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated Annealing for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Look at Nonnegativity on Closed Sets and Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hit-and-run mixes fast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Search and Optimization / rank
 
Normal rank

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

    Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing (English)
    0 references
    0 references
    0 references
    12 March 2020
    0 references
    polynomial optimization
    0 references
    semidefinite optimization
    0 references
    Lasserre hierarchy
    0 references
    simulated annealing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references