Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
From MaRDI portal
Publication:850828
DOI10.1007/s10957-005-6550-9zbMath1116.90093MaRDI 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 qualifications; locally Lipschitz functions; convexificators; directional Dini derivatives; Nonsmooth multiobjective optimization; stronger Kuhn-Tucker conditions
90C29: Multi-objective and goal programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
First-order necessary conditions in locally Lipschitz multiobjective optimization, 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 the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators, Some kind of Pareto stationarity for multiobjective problems with equilibrium constraints, Proper efficiency and proper Karush-Kuhn-Tucker conditions for smooth multiobjective optimization problems, Convexificators and strong Kuhn-Tucker conditions, Optimality conditions for multiobjective fractional programming, via convexificators, Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems, Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization, Constraint qualifications and proper Pareto optimality conditions for multiobjective problems with equilibrium constraints, On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization, Characterizations of efficient and weakly efficient points in nonconvex vector optimization, Second-order strong Karush/Kuhn-Tucker conditions for proper efficiencies in multiobjective optimization, Nonsmooth multiobjective programming and constraint qualifications, On some vector ƒ-complementarity problems
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
