Convexificators and strong Kuhn-Tucker conditions

DOI10.1016/j.camwa.2011.12.047zbMath1252.90073OpenAlexW2067239116MaRDI QIDQ692289

Soghra Nobakhtian, M. Golestani

Publication date: 4 December 2012

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.12.047

zbMATH Keywords

nonsmooth optimizationoptimality conditionsmultiobjective programmingconstraint qualificationconvexificator

Mathematics Subject Classification ID

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

Related Items

Optimality conditions and duality for interval-valued optimization problems using convexifactors, 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, Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications, Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators, Nondifferentiable minimax programming problems with applications, On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints, Applying directional upper semi-regular convexificators in bilevel 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, Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators, 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, Characterizations of efficient and weakly efficient points in nonconvex vector optimization, Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators, On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators, Necessary efficiency conditions for vector equilibrium problems with general inequality constraints via convexificators, Optimality conditions for multiobjective fractional programming, via convexificators, Optimality conditions for nonsmooth semidefinite programming via convexificators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
• A generalized derivative for calm and stable functions
• On constraint qualification in multiobjective optimization problems: Semidifferentiable case
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Constrained qualifications in multiobjective optimization problems: Differentiable case
• Hunting for a smaller convex subdifferential
• 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
• A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
• The Linear Nonconvex Generalized Gradient and Lagrange Multipliers