A utopia point method-based robust vector polynomial optimization scheme (Q6154404): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Duality in robust optimization: Primal worst equals dual best / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization-methodology and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected topics in 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: Linear Multiple Objective Problems with Interval Coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760254 / 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: Second-order cone programming relaxations for a class of multiobjective convex polynomial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Implementations for Nonsmooth Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new scheme for approximating the weakly efficient solution set of vector rational optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly 3: moments, optimization and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On robust multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A “Joint+Marginal” Approach to Parametric Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and robust polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for semi-infinite polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Polynomial and Semi-Algebraic Optimization / 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: Q5045850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective convex polynomial optimization and semidefinite programming relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying convergence of Lasserre's hierarchy via flat truncation / 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: Linear optimization with cones of moments and nonnegative polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of multiobjective optimization / 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: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank

Latest revision as of 10:29, 27 August 2024

scientific article; zbMATH DE number 7805316
Language Label Description Also known as
English
A utopia point method-based robust vector polynomial optimization scheme
scientific article; zbMATH DE number 7805316

    Statements

    A utopia point method-based robust vector polynomial optimization scheme (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 February 2024
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    vector optimization
    0 references
    polynomial optimization
    0 references
    robust counterpart
    0 references
    utopia point method
    0 references
    SDP relaxations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references