Pages that link to "Item:Q2279398"
From MaRDI portal
The following pages link to Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials (Q2279398):
Displaying 10 items.
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data (Q1743539) (← links)
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
- Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications (Q2025164) (← links)
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- Existence of Pareto solutions for vector polynomial optimization problems with constraints (Q2082235) (← links)
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems (Q2150767) (← links)
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint (Q2663356) (← links)
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules (Q2677664) (← links)
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions (Q6161553) (← links)
