scientific article; zbMATH DE number 7620762
From MaRDI portal
Publication:5052072
Recommendations
- Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
- Approximate optimality conditions for robust convex optimization without convexity of constraints
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- scientific article; zbMATH DE number 6508503
- On approximate efficiency for nonsmooth robust vector optimization problems
- On approximate optimality conditions for robust multi-objective convex optimization problems
- Optimality and duality in nonsmooth conic vector optimization
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
Cited in
(8)- Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
- Robust duality for generalized convex nonsmooth vector programs with uncertain data in constraints
- On some efficiency conditions for vector optimization problems with uncertain cone constraints: a robust approach via set-valued inclusions
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
- Approximate optimality and approximate duality in nonsmooth composite vector optimization
- Approximate solutions in nonsmooth robust optimization with locally Lipschitz constraints
- On approximate efficiency for nonsmooth robust vector optimization problems
- On approximate solutions for nonsmooth robust multiobjective optimization problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5052072)
