Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (Q2678586): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Frank--Wolfe type theorem for convex polynomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization-methodology and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust convex quadratically constrained programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact SDP relaxations for classes of nonlinear semidefinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of alternative theorems for SOS-convex inequalities and robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust SOS-convex polynomial optimization problems: exact SDP relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness / 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: Global Optimization with Polynomials and the Problem of Moments / 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: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic Properties for Semialgebraic Programs / 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: Some geometric results in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of squares on real algebraic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguished representations of non-negative polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(K\)-moment problem for compact semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general minimax theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: WHAT IS...a Spectrahedron? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149262 / rank
 
Normal rank

Latest revision as of 08:40, 31 July 2024

scientific article
Language Label Description Also known as
English
Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems
scientific article

    Statements

    Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    23 January 2023
    0 references
    convex polynomial
    0 references
    robust optimization
    0 references
    optimality conditions
    0 references
    SDP relaxations
    0 references
    convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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