Optimality and duality in semi-infinite minimax programming with G–V semipreinvexity
摘要
Novel classes of generalized convexity, specifically including G–V-semipreinvexity and semistrictly G–V-semipreinvexity, are introduced in this paper. Under these newly defined convexity, necessary and sufficient optimality conditions for semi-infinite minimax optimization problems are established. Furthermore, Mond–Weir type and Wolfe type dual models are developed for the primal problem. Rigorous proofs demonstrate that duality theorems hold consistently within the same framework. The developed theory can be applied across multiple domains. It can be employed in uncertainty and minimax optimization, particularly in aerodynamic design and financial risk modeling. Extensions of the theory can also be made to robust optimization frameworks and machine learning fields.