Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-019-03216-z / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-019-03216-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2936699287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex polynomial that is not sos-convex / 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: Duality in robust optimization: Primal worst equals dual best / 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: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex 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: Q3760254 / 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: Optimality and duality for robust multiobjective optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4557933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust multiobjective optimization with application to Internet routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved \(\varepsilon\)-constraint method for multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in Nonlinear Programming: A Simplified Applications-Oriented Development / 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: Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts / 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: Q2841072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving fractional multicriteria optimization problems with sum of squares convex polynomial data / 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: Convexity in SemiAlgebraic Geometry and Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal psd forms with few terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128119462 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-019-03216-Z / rank
 
Normal rank

Latest revision as of 04:22, 10 December 2024

scientific article
Language Label Description Also known as
English
Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
scientific article

    Statements

    Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (English)
    0 references
    0 references
    0 references
    5 May 2021
    0 references
    multiobjective optimization
    0 references
    robust optimization
    0 references
    semidefinite programming relaxations
    0 references
    SOS-convex polynomials
    0 references
    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