Pages that link to "Item:Q2228362"
From MaRDI portal
The following pages link to On approximate solutions and saddle point theorems for robust convex optimization (Q2228362):
Displayed 13 items.
- Robust optimality in constrained optimization problems with application in mechanics (Q2157701) (← links)
- Robust penalty function method for an uncertain multi-time control optimization problems (Q2235881) (← links)
- Some characterizations of approximate solutions for robust semi-infinite optimization problems (Q2664903) (← links)
- Characterizations of robust<i>ε</i>-quasi optimal solutions for nonsmooth optimization problems with uncertain data (Q4986407) (← links)
- Robust saddle-point criteria for multi-dimensional control optimisation problems with data uncertainty (Q5012669) (← links)
- On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty (Q5069193) (← links)
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty (Q5121777) (← links)
- Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators (Q6038921) (← links)
- Necessary and sufficient optimality conditions for some robust variational problems (Q6054496) (← links)
- Robust saddle‐point criterion in second‐order partial differential equation and partial differential inequation constrained control problems (Q6082373) (← 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)
- A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems (Q6187726) (← links)