Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems

DOI10.1007/s11750-008-0058-zzbMath1198.90348MaRDI QIDQ845569

Giorgio Giorgi, Bienvenido Jiménez, Vicente Novo Sanjurjo

Publication date: 29 January 2010

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-008-0058-z

zbMATH Keywords

Lagrange multipliers; multiobjective optimization; necessary conditions; Clarke subdifferential; relationship; Pareto optima; Kuhn-Tucker theory; Lipshitz functions; strong conditions

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C29: Multi-objective and goal programming

90C46: Optimality conditions and duality in mathematical programming

49J30: Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.)

49K30: Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.)

Related Items

A note on second-order Karush–Kuhn–Tucker necessary optimality conditions for smooth vector optimization problems, First-order necessary conditions in locally Lipschitz multiobjective optimization, ϵ-Efficient solutions in semi-infinite multiobjective optimization, Multiobjective optimal control of a non-smooth semilinear elliptic partial differential equation, Constraint qualifications in nonsmooth multiobjective optimization problem, Strong second-order Karush–Kuhn–Tucker optimality conditions for vector optimization, Some kind of Pareto stationarity for multiobjective problems with equilibrium constraints, Dini and Hadamard directional derivatives in multiobjective optimization: an overview of some results, Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds, Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions, Proper efficiency and proper Karush-Kuhn-Tucker conditions for smooth multiobjective optimization problems, Second-order optimality conditions in locally Lipschitz inequality-constrained multiobjective optimization, On Abadie constraint qualification for multiobjective optimization problems, Constraint qualifications and proper Pareto optimality conditions for multiobjective problems with equilibrium constraints, On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization, Second-order necessary conditions in locally Lipschitz optimization with inequality constraints, Characterizations of efficient and weakly efficient points in nonconvex vector optimization, Necessary conditions for weak minima and for strict minima of order two in nonsmooth constrained multiobjective optimization, On Tucker-type alternative theorems and necessary optimality conditions for nonsmooth multiobjective optimization, Locally Lipschitz vector optimization problems: second-order constraint qualifications, regularity condition and KKT necessary optimality conditions, Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones, On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming, Necessary conditions for weak efficiency for nonsmooth degenerate multiobjective optimization problems, Necessary conditions for efficiency in terms of the Michel–Penot subdifferentials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
• Theory of multiobjective optimization
• On constraint qualification in multiobjective optimization problems: Semidifferentiable case
• Regularity conditions in vector optimization
• Optimality conditions for directionally differentiable multi-objective programming problems
• Constrained qualifications in multiobjective optimization problems: Differentiable case
• Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
• Constraint qualifications in nonsmooth multiobjective optimization
• On constraint qualifications in directionally differentiable multiobjective optimization problems
• Convex Analysis