Pages that link to "Item:Q1670545"
From MaRDI portal
The following pages link to Characterizations of robust solution set of convex programs with uncertain data (Q1670545):
Displaying 12 items.
- 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)
- Weighted robust optimality of convex optimization problems with data uncertainty (Q2191283) (← links)
- On approximate solutions and saddle point theorems for robust convex optimization (Q2228362) (← 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)
- (Q3384701) (← links)
- Necessary optimality conditions for nonsmooth robust optimization problems (Q5090284) (← links)
- (Q5121102) (← links)
- Optimality conditions of robust convex multiobjective optimization via<i>ε</i>-constraint scalarization and image space analysis (Q5121765) (← links)
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty (Q5121777) (← links)
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials (Q6064032) (← links)
