Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
From MaRDI portal
Publication:850828
DOI10.1007/s10957-005-6550-9zbMath1116.90093OpenAlexW2045433563MaRDI QIDQ850828
Publication date: 6 November 2006
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-005-6550-9
constraint qualificationslocally Lipschitz functionsconvexificatorsdirectional Dini derivativesNonsmooth multiobjective optimizationstronger Kuhn-Tucker conditions
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (24)
Robustness in nonsmooth nonconvex optimization problems ⋮ Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems ⋮ First-order necessary conditions in locally Lipschitz multiobjective optimization ⋮ Strong and weak conditions of regularity and optimality ⋮ Dini and Hadamard directional derivatives in multiobjective optimization: an overview of some results ⋮ On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization ⋮ Second-order strong Karush/Kuhn-Tucker conditions for proper efficiencies in multiobjective optimization ⋮ Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints ⋮ Some kind of Pareto stationarity for multiobjective problems with equilibrium constraints ⋮ Proper efficiency and proper Karush-Kuhn-Tucker conditions for smooth multiobjective optimization problems ⋮ 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 ⋮ Constraint qualifications and proper Pareto optimality conditions for multiobjective problems with equilibrium constraints ⋮ Convexificators and strong Kuhn-Tucker conditions ⋮ Characterizations of efficient and weakly efficient points in nonconvex vector optimization ⋮ Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization ⋮ On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators ⋮ On some vector ƒ-complementarity problems ⋮ Nonsmooth multiobjective programming and constraint qualifications ⋮ Optimality conditions for multiobjective fractional programming, via convexificators ⋮ Duality for a class of nonsmooth multiobjective programming problems using convexificators ⋮ Constraint qualifications in nonsmooth multiobjective optimization problem ⋮ On Tucker-type alternative theorems and necessary optimality conditions for nonsmooth multiobjective optimization ⋮ Optimality and duality for nonsmooth minimax programming problems using convexifactor
Cites Work
- Convexifactors, generalized convexity, and optimality conditions
- On constraint qualification in multiobjective optimization problems: Semidifferentiable case
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Optimal competence set expansion using deduction graphs
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Hunting for a smaller convex subdifferential
- Tangent Sets’ Calculus and Necessary Conditions for Extremality
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions
- Approximate Hessian matrices and second-order optimality conditions for nonlinear programming problems with C1-data
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
This page was built for publication: Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
