A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696): 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: 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: Lectures on Modern Convex 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: 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: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4762223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representation of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of solution sets of convex vector minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2789157 / 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: Inequality systems and global optimization / 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: Q3395491 / 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: Q3601990 / 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: Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank

Latest revision as of 07:57, 22 July 2024

scientific article
Language Label Description Also known as
English
A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
scientific article

    Statements

    A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (English)
    0 references
    0 references
    0 references
    0 references
    7 April 2020
    0 references
    0 references
    vector optimization
    0 references
    hybrid method
    0 references
    semidefinite programming
    0 references
    SOS-convex polynomials
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references