Nonsmooth multiobjective programming and constraint qualifications

DOI10.1080/02331934.2012.679939zbMath1302.90247OpenAlexW1968869446MaRDI QIDQ2841157

M. Golestani, Soghra Nobakhtian

Publication date: 24 July 2013

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

nonsmooth analysismultiobjective optimizationnecessary conditionsconstraint qualification

Mathematics Subject Classification ID

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

Related Items (12)

Robustness in nonsmooth nonconvex optimization problems ⋮ Optimality Conditions for Isolated Local Minimum of Nonsmooth Multiobjective Problems ⋮ Convexificators and boundedness of the Kuhn–Tucker multipliers set ⋮ Strong and weak conditions of regularity and optimality ⋮ Second-order strong Karush/Kuhn-Tucker conditions for proper efficiencies in multiobjective optimization ⋮ On optimality conditions and duality for multiobjective optimization with equilibrium constraints ⋮ Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators ⋮ On approximate Karush-Kuhn-Tucker conditions for multiobjective optimization problems ⋮ Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization ⋮ Optimality conditions for nonsmooth semidefinite programming via convexificators

Cites Work

• Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
• On constraint qualification in multiobjective optimization problems: Semidifferentiable case
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Constrained qualifications in multiobjective optimization problems: Differentiable case
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C¹-Optimization
• A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
• Convexifactors, generalized convexity and vector optimization
• The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
• Nonlinear Programming

This page was built for publication: Nonsmooth multiobjective programming and constraint qualifications