Surrogate duality for robust quasiconvex vector optimization

zbMATH Open1484.90089MaRDI QIDQ5072157FDOQ5072157

Authors: Satoshi Suzuki, Daishi Kuroiwa 

Publication date: 25 April 2022

Full work available at URL: http://yokohamapublishers.jp/online2/opaao/vol2/p27.html

Recommendations

• Surrogate duality for robust optimization
• Robust duality for nonconvex uncertain vector optimization via a general scalarization
• Complete characterizations of robust strong duality for robust vector optimization problems
• Robust duality for generalized convex nonsmooth vector programs with uncertain data in constraints
• scientific article; zbMATH DE number 7653176

zbMATH Keywords

multiobjective programmingconstraint qualificationsurrogate dualityrobust vector optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Convexity of real functions of several variables, generalizations (26B25) Semi-infinite programming (90C34)

Cited In (6)

• Robust Nash equilibria in vector-valued games with uncertainty
• Surrogate duality for vector optimization
• Robust duality for nonconvex uncertain vector optimization via a general scalarization
• SDP reformulation for robust optimization problems based on nonconvex QP duality
• Surrogate duality for robust optimization
• Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization

This page was built for publication: Surrogate duality for robust quasiconvex vector optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5072157)