Convexificators and boundedness of the Kuhn–Tucker multipliers set

DOI10.1080/02331934.2017.1337763zbMath1429.90073OpenAlexW2623920250MaRDI QIDQ4559391

A. Ansari Ardali, Nooshin Movahedian, Soghra Nobakhtian

Publication date: 3 December 2018

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

nonsmooth optimizationoptimality conditionconstraint qualificationconvexificatorKuhn-Tucker multipliers set

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions
• Convexificators and strong Kuhn-Tucker conditions
• Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization
• A generalized derivative for calm and stable functions
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Error bounds for generalized Lagrange multipliers in locally Lipschitz programming
• Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
• Hunting for a smaller convex subdifferential
• Convex analysis and nonlinear optimization. Theory and examples
• A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization
• Necessary optimality conditions for bilevel optimization problems using convexificators
• Nonsmooth multiobjective programming and constraint qualifications
• Optimization and nonsmooth analysis
• On conditions to have bounded multipliers in locally lipschitz programming
• Clarke's tangent cones and the boundaries of closed sets in Rn
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• 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