Tangential subdifferential-based necessary conditions for multiobjective min-max optimization

DOI10.1016/J.JMAA.2026.130982MaRDI QIDQ7347201zbMATH OpenFDO

Authors Marwane Cherrouf, Nazih Abderrazzak Gadhi

Publication date 14 September 2026

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JMAA.2026.130982

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Semi-infinite programming (90C34) Optimality conditions and duality in mathematical programming (90C46) Minimax problems in mathematical programming (90C47)

Cites work

• A simple approach to optimality conditions in minmax programming
• An introduction to the theory of nonsmooth optimization
• Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
• Constraint qualifications and optimality conditions in nonsmooth locally star-shaped optimization using convexificators
• Convex Analysis
• Foundations of Optimization
• scientific article; zbMATH DE number 3882193 (Why is no real title available?)
• scientific article; zbMATH DE number 1070896 (Why is no real title available?)
• scientific article; zbMATH DE number 3336546 (Why is no real title available?)
• Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
• Necessary conditions and sufficient conditions for static minmax problems
• Optimality conditions for constrained minimax optimization
• Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
• Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks
• Optimality conditions for nonsmooth semi-infinite multiobjective programming
• Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
• Optimization and nonsmooth analysis
• Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints
• Robustness in nonsmooth nonconvex optimization problems
• Sufficient Conditions for Global Minima of Suitably Convex Functionals from Variational and Control Theory

This page was built for publication: Tangential subdifferential-based necessary conditions for multiobjective min-max optimization

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