An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization (Q384182): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits. / 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: Minimizing polynomials via sum of squares over the gradient ideal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Putinar's Positivstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank

Latest revision as of 02:10, 7 July 2024

scientific article
Language Label Description Also known as
English
An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization
scientific article

    Statements

    An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization (English)
    0 references
    27 November 2013
    0 references
    approximation bound
    0 references
    Lasserre's relaxation
    0 references
    polynomials
    0 references
    semidefinite programming
    0 references
    sum of squares
    0 references
    0 references

    Identifiers