Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators

DOI10.1080/01630563.2017.1351455zbMath1390.49027OpenAlexW2734743948MaRDI QIDQ4639187

Nooshin Movahedian, Mansoureh Alavi Hejazi, Soghra Nobakhtian

Publication date: 3 May 2018

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2017.1351455

zbMATH Keywords

nonsmooth analysisconstraint qualificationnecessary optimality conditionmultiobjective optimization problempseudo-differentialconvexificator

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Optimality conditions (49K99)

Related Items (4)

On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity ⋮ Optimality Conditions for Multiobjective Optimization Problems via Image Space Analysis ⋮ Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints ⋮ On nonsmooth mathematical programs with equilibrium constraints using generalized convexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications
• Convexificators and strong Kuhn-Tucker conditions
• Approximate Karush-Kuhn-Tucker condition in multiobjective optimization
• Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
• Error bounds: necessary and sufficient conditions
• Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization
• A generalized derivative for calm and stable functions
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Nonlinear multiobjective optimization
• Hunting for a smaller convex subdifferential
• Pseudonormality and a Lagrange multiplier theory for constrained optimization
• Necessary and sufficient conditions for efficiency via convexificators
• Necessary optimality conditions in terms of convexificators in Lipschitz optimization
• Nonsmooth vector functions and continuous optimization
• Nonsmooth multiobjective programming and constraint qualifications
• Optimization and nonsmooth analysis
• Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C¹-Optimization
• Convexifactors, generalized convexity and vector optimization
• The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
• Mathematical Programs with Geometric Constraints in Banach Spaces: Enhanced Optimality, Exact Penalty, and Sensitivity

This page was built for publication: Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators