Upper level qualifications and optimality in multiobjective convex generalized semi-infinite problems

DOI10.30495/JME.V17I0.2805MaRDI QIDQ6569540zbMATH OpenFDO

Authors Golnaz Edalat, Nader Kanzi, Marjan Adib

Publication date 9 July 2024

Published in Journal of Mathematical Extension (Search for Journal in Brave)

Full work available at URL https://doi.org/10.30495/JME.V17I0.2805

zbMATH Keywords

constraint qualificationconvex subdifferentialmultiobjective GSIPnecessary condition

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Markov and semi-Markov decision processes (90C40)

Recommendations

• Optimality conditions for nonsmooth semi-infinite multiobjective programming
• Optimality conditions for strict minimizers of higher-order in semi-infinite multi-objective optimization
• Optimality conditions in nonconvex semi-infinite multiobjective optimization problems
• Necessary conditions in generalized semi-infinite optimization with nondifferentiable convex data
• Nonsmooth multiobjective semi-infinite problems with mixed constraints

Cites work

• Bi-level strategies in semi-infinite programming.
• Constraint qualifications in nonsmooth multiobjective optimization
• Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints
• Convex Analysis
• Fritz-John type necessary conditions for optimality of convex generalized semi-infinite optimization problems
• Generalized semi-infinite optimization: A first order optimality condition and examples
• Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
• Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
• Necessary conditions in generalized semi-infinite optimization with nondifferentiable convex data
• Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
• On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
• On vector generalized semi-infinite programming
• Optimality conditions in convex multiobjective SIP
• Optimality, scalarization and duality in linear vector semi-infinite programming
• Set-valued mappings and enlargement of monotone operators.
• Subgradients of marginal functions in parametric mathematical programming

This page was built for publication: Upper level qualifications and optimality in multiobjective convex generalized semi-infinite problems

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