Pages that link to "Item:Q2038921"
From MaRDI portal
The following pages link to Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921):
Displaying 12 items.
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data (Q1743539) (← links)
- Approximating Pareto curves using semidefinite relaxations (Q1785276) (← links)
- On the use of polynomial models in multiobjective directional direct search (Q2023694) (← links)
- Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects (Q2040606) (← 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)
- Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials (Q2279398) (← links)
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint (Q2663356) (← links)
- (Q3059324) (← links)
- Solvability of a regular polynomial vector optimization problem without convexity (Q5882837) (← links)
- A new scheme for approximating the weakly efficient solution set of vector rational optimization problems (Q6109053) (← links)
- A utopia point method-based robust vector polynomial optimization scheme (Q6154404) (← links)
