A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2017.04.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2611961450 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59241415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Uncertainty Sets for Robust Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust convex quadratically constrained programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial optimization over non-compact semi-algebraic sets / 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: 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: Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust global optimization with polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pre- and Post-Processing Sum-of-Squares Programs in Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix sum-of-squares relaxations for robust semi-definite programs / rank
 
Normal rank

Latest revision as of 09:32, 18 July 2024

scientific article
Language Label Description Also known as
English
A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
scientific article

    Statements

    A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (English)
    0 references
    22 February 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    robust optimization
    0 references
    global polynomial optimization
    0 references
    optimization under data uncertainty
    0 references
    nonconvex optimization
    0 references
    semi-definite programming relaxations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references