Pages that link to "Item:Q2338487"
From MaRDI portal
The following pages link to Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints (Q2338487):
Displaying 11 items.
- Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization (Q2082239) (← links)
- An approach to characterizing \(\epsilon\)-solution sets of convex programs (Q2146365) (← links)
- Characterizing the solution set of convex optimization problems without convexity of constraints (Q2191285) (← links)
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty (Q2244235) (← links)
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems (Q2322364) (← links)
- Robust efficiency and well-posedness in uncertain vector optimization problems (Q5885204) (← links)
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials (Q6064032) (← links)
- On second-order conic programming duals for robust convex quadratic optimization problems (Q6160375) (← links)
- On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems (Q6200383) (← links)
- On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential (Q6204200) (← links)
- Optimality and duality for robust optimization problems involving intersection of closed sets (Q6608754) (← links)
