A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization (Q6081938): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hausdorff approximations and volume of tubes of singular algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and accurate computation of upper bounds of approximation errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Khachiyan’s algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5791470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong duality in lasserre's hierarchy for polynomial optimization / 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: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the volume of tubular neighborhoods of real algebraic varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOS Is Not Obviously Automatizable, Even Approximately / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bit Complexity of Sum-of-Squares Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact duality theory for semidefinite programming and its complexity implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Volumes of tubular neighbourhoods of real algebraic varieties / rank
 
Normal rank

Latest revision as of 10:51, 3 August 2024

scientific article; zbMATH DE number 7760772
Language Label Description Also known as
English
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
scientific article; zbMATH DE number 7760772

    Statements

    A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization (English)
    0 references
    0 references
    0 references
    0 references
    3 November 2023
    0 references
    computational complexity
    0 references
    moment-SOS hierarchy
    0 references
    moments
    0 references
    polynomial optimization
    0 references
    semidefinite programming
    0 references
    sums of squares
    0 references
    0 references
    0 references
    0 references

    Identifiers