A bounded degree SOS hierarchy for polynomial optimization (Q2397758): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s13675-015-0050-y / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SPOTless / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1822269556 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1501.06126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain / rank
 
Normal rank
Property / cites work
 
Property / cites work: The truncated complex $K$-moment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5490302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxations and Integrality Gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A collection of test problems for constrained global optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Global Optimality and Extracting Solutions in GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly 3: moments, optimization and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representation of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anneaux preordonnes / 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: Semidefinite Programming vs. LP Relaxations for Polynomial Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in SemiAlgebraic Geometry and Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions and finite convergence of Lasserre's hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nullstellensatz and a Positivstellensatz in semialgebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S13675-015-0050-Y / rank
 
Normal rank

Latest revision as of 09:45, 18 December 2024

scientific article
Language Label Description Also known as
English
A bounded degree SOS hierarchy for polynomial optimization
scientific article

    Statements

    A bounded degree SOS hierarchy for polynomial optimization (English)
    0 references
    0 references
    0 references
    0 references
    23 May 2017
    0 references
    global optimization
    0 references
    polynomial optimization
    0 references
    convex relaxations
    0 references
    LP and semidefinite hierarchies
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers