Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (Q6103695): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A convex polynomial that is not sos-convex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook on semidefinite, conic and polynomial optimization / 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: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust linear optimization under general norms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact relaxations for parametric robust linear optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic linear programming duals for classes of quadratic semi-infinite programs with applications / 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: A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4557933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and closedness in stable robust duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust convex quadratically constrained programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representation of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality in Robust Convex Programming: Complete Characterizations / 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: Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization 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: Dual semidefinite programs without duality gaps for a class of convex minimax programs / 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 minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Several NP-hard problems arising in robust stability analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2978415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some geometric results in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: WHAT IS...a Spectrahedron? / rank
 
Normal rank

Revision as of 12:20, 1 August 2024

scientific article; zbMATH DE number 7702977
Language Label Description Also known as
English
Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
scientific article; zbMATH DE number 7702977

    Statements

    Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (English)
    0 references
    0 references
    0 references
    27 June 2023
    0 references
    robust optimization
    0 references
    convex polynomial
    0 references
    stable exact relaxation
    0 references
    spectrahedral uncertainty set
    0 references
    conic relaxation
    0 references
    0 references
    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
    0 references