Pages that link to "Item:Q331984"
From MaRDI portal
The following pages link to Some characterizations of robust optimal solutions for uncertain convex optimization problems (Q331984):
Displaying 23 items.
- Robustness in nonsmooth nonconvex optimization problems (Q830202) (← links)
- Characterizations of robust solution set of convex programs with uncertain data (Q1670545) (← links)
- On quasi \(\epsilon\)-solution for robust convex optimization problems (Q1686550) (← links)
- Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators (Q2074630) (← links)
- Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization (Q2082239) (← links)
- Robust strong duality for nonconvex optimization problem under data uncertainty in constraint (Q2142822) (← links)
- Weighted robust optimality of convex optimization problems with data uncertainty (Q2191283) (← links)
- Robustness characterizations for uncertain optimization problems via image space analysis (Q2194124) (← links)
- On approximate solutions and saddle point theorems for robust convex optimization (Q2228362) (← links)
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty (Q2244235) (← links)
- Radius of robust feasibility of system of convex inequalities with uncertain data (Q2302748) (← links)
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems (Q2322364) (← links)
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints (Q2338487) (← links)
- Convexity and closedness in stable robust duality (Q2414114) (← links)
- Necessary optimality conditions for nonsmooth robust optimization problems (Q5090284) (← links)
- (Q5121102) (← links)
- Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators (Q6038921) (← links)
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials (Q6064032) (← links)
- Applying convexificators in robust multiobjective optimization (Q6086987) (← links)
- Robust duality for robust efficient solutions in uncertain vector optimization problems (Q6104283) (← links)
- A sublinear functional based approximated equivalence to optimality and duality for multiobjective programming in complex spaces (Q6567285) (← links)
- Optimality and duality for robust optimization problems involving intersection of closed sets (Q6608754) (← links)
- Strong and total Fenchel dualities for robust composed convex optimization problems in locally convex spaces (Q6629773) (← links)
