The following pages link to (Q2841072):
Displaying 13 items.
- Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality (Q778163) (← links)
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
- Complete characterizations of robust strong duality for robust vector optimization problems (Q1639956) (← links)
- Characterizations of robust solution set of convex programs with uncertain data (Q1670545) (← links)
- A unifying approach to robust convex infinite optimization duality (Q1673912) (← links)
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations (Q2257075) (← links)
- Characterizing robust solution sets of convex programs under data uncertainty (Q2260682) (← links)
- Strong and total Fenchel dualities for robust convex optimization problems (Q2262012) (← links)
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints (Q2338487) (← links)
- Strong duality for robust minimax fractional programming problems (Q2355075) (← links)
- Prices stabilization for inexact unit-commitment problems (Q2636928) (← links)
- Generalized robust duality in constrained nonconvex optimization (Q4986415) (← links)
- (Q5121102) (← links)
