Pages that link to "Item:Q1984696"
From MaRDI portal
The following pages link to A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696):
Displaying 5 items.
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- Existence of Pareto solutions for vector polynomial optimization problems with constraints (Q2082235) (← links)
- A utopia point method-based robust vector polynomial optimization scheme (Q6154404) (← links)
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions (Q6161553) (← links)
- On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems (Q6200383) (← links)
