Pages that link to "Item:Q2150767"
From MaRDI portal
The following pages link to Second-order cone programming relaxations for a class of multiobjective convex polynomial problems (Q2150767):
Displaying 12 items.
- Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems (Q380592) (← links)
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- A note on completely positive relaxations of quadratic problems in a multiobjective framework (Q2114601) (← links)
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization (Q2150766) (← links)
- On polyhedral and second-order cone decompositions of semidefinite optimization problems (Q2294533) (← links)
- Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs (Q3004990) (← links)
- (Q5442488) (← 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)
- 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)
- Robust second order cone conditions and duality for multiobjective problems under uncertainty data (Q6203549) (← links)
