Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints (Q1785470): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2015.11.011 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: YALMIP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59241440 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2234594789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complete Characterization of the Gap between Convexity and SOS-Convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Frank--Wolfe type theorem for convex polynomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deriving robust counterparts of nonlinear uncertain inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability and Well-Posedness in Linear Semi-Infinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Solutions to Least-Squares Problems with Uncertain Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions to multi-objective linear programs with uncertain data / 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 robust set containments and solutions of uncertain linear programs without qualifications / 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: 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: Pre- and Post-Processing Sum-of-Squares Programs in Practice / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2015.11.011 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:34, 11 December 2024

scientific article
Language Label Description Also known as
English
Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
scientific article

    Statements

    Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints (English)
    0 references
    0 references
    28 September 2018
    0 references
    robust optimization
    0 references
    convex programming
    0 references
    data uncertainty
    0 references
    radius of robust feasibility
    0 references
    0 references

    Identifiers