Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Jia-Wang Nie / rank
Normal rank
 
Property / author
 
Property / author: Jia-Wang Nie / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GloptiPoly / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964603869 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1206.0319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143433 / 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: GloptiPoly / 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: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representations for finite varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of non-negative polynomials having finitely many zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452017 / 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: Algebraic Degree of Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discriminants and nonnegative polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact Jacobian SDP relaxation for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying convergence of Lasserre's hierarchy via flat truncation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Optimization with Real Varieties / 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: Non-existence of degree bounds for weighted sums of squares representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguished representations of non-negative polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of squares of regular functions on real algebraic varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4781203 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:53, 8 July 2024

scientific article
Language Label Description Also known as
English
Optimality conditions and finite convergence of Lasserre's hierarchy
scientific article

    Statements

    Optimality conditions and finite convergence of Lasserre's hierarchy (English)
    0 references
    29 August 2014
    0 references
    This paper studies the relationship between the classic nonlinear programming theory and Lasserre's hierarchy of semidefinite relaxations in polynomial optimization. Under some mild conditions, the author proves that Lasserre's hierarchy has finite convergence.
    0 references
    Lasserre's hierarchy
    0 references
    optimality conditions
    0 references
    polynomial optimization
    0 references
    semidefinite program
    0 references
    sum of squares
    0 references
    finite convergence
    0 references
    0 references
    0 references
    0 references

    Identifiers

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