Robust duality for nonconvex uncertain vector optimization via a general scalarization
From MaRDI portal
Recommendations
- Complete characterizations of robust strong duality for robust vector optimization problems
- Generalized robust duality in constrained nonconvex optimization
- Surrogate duality for robust quasiconvex vector optimization
- Robust duality for generalized convex nonsmooth vector programs with uncertain data in constraints
- Primal worst and dual best in robust vector optimization
Cites work
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- A unified approach through image space analysis to robustness in uncertain optimization problems
- A unified approach to robust Farkas-type results with applications to robust optimization problems
- A unified characterization of multiobjective robustness via separation
- Characterizations of multiobjective robustness via oriented distance function and image space analysis
- Characterizations of robust optimality conditions via image space analysis
- Complete characterizations of robust strong duality for robust vector optimization problems
- Constrained extremum problems and image space analysis. I: Optimality conditions
- Constrained extremum problems and image space analysis. II: Duality and penalization
- Constrained extremum problems and image space analysis. III: Generalized systems
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Duality in nonconvex vector optimization
- Duality in robust optimization: Primal worst equals dual best
- Duality in Vector Optimization
- Generalized robust duality in constrained nonconvex optimization
- Image space analysis to Lagrange-type duality for constrained vector optimization problems with applications
- Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Primal worst and dual best in robust vector optimization
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust duality in parametric convex optimization
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust optimization
- Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality
- Separation functions and optimality conditions in vector optimization
- Strong duality in robust convex programming: complete characterizations
- Theory and applications of robust optimization
- Unified duality theory for constrained extremum problems. I: Image space analysis
- Unified duality theory for constrained extremum problems. II: Special duality schemes
- Vector Optimization
- Vector optimization and monotone operators via convex duality. Recent advances
Cited in
(7)- A unifying approach to robust convex infinite optimization duality
- Primal worst and dual best in robust vector optimization
- Generalized robust duality in constrained nonconvex optimization
- Surrogate duality for robust quasiconvex vector optimization
- Robust duality for generalized convex nonsmooth vector programs with uncertain data in constraints
- Robust duality for robust efficient solutions in uncertain vector optimization problems
- Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality
This page was built for publication: Robust duality for nonconvex uncertain vector optimization via a general scalarization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6079803)
