Pages that link to "Item:Q828872"
From MaRDI portal
The following pages link to Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872):
Displaying 13 items.
- Well-posedness for the optimistic counterpart of uncertain vector optimization problems (Q828816) (← 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)
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty (Q2108799) (← links)
- Minimax programming as a tool for studying robust multi-objective optimization problems (Q2108806) (← links)
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization (Q2150766) (← 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)
- A utopia point method-based robust vector polynomial optimization scheme (Q6154404) (← links)
- Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data (Q6159528) (← 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)
