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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
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.
Property / review text: 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. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Guo-Qiang Wang / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65K05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C22 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C26 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6336099 / rank
 
Normal rank
Property / zbMATH Keywords
 
Lasserre's hierarchy
Property / zbMATH Keywords: Lasserre's hierarchy / rank
 
Normal rank
Property / zbMATH Keywords
 
optimality conditions
Property / zbMATH Keywords: optimality conditions / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial optimization
Property / zbMATH Keywords: polynomial optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
semidefinite program
Property / zbMATH Keywords: semidefinite program / rank
 
Normal rank
Property / zbMATH Keywords
 
sum of squares
Property / zbMATH Keywords: sum of squares / rank
 
Normal rank
Property / zbMATH Keywords
 
finite convergence
Property / zbMATH Keywords: finite convergence / rank
 
Normal rank

Revision as of 16:56, 29 June 2023

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
    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

    Identifiers