Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization
From MaRDI portal
Publication:987521
DOI10.1007/s10957-009-9644-yzbMath1201.90181OpenAlexW2014284108MaRDI QIDQ987521
Publication date: 13 August 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-009-9644-y
constraint qualificationsnonsmooth multiobjective optimizationexistence and boundedness of Kuhn-Tucker multipliersupper convexificators
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Convexificators and boundedness of the Kuhn–Tucker multipliers set ⋮ Optimality conditions in optimization problems with convex feasible set using convexificators ⋮ Optimality conditions for nonsmooth multiobjective bilevel 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 ⋮ Existence and boundedness of second-order Karush-Kuhn-Tucker multipliers for set-valued optimization with variable ordering structures
Cites Work
- Unnamed Item
- Unnamed Item
- Convexifactors, generalized convexity, and optimality conditions
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- 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
- Generalized properly efficient solutions of vector optimization problems
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Optimization and nonsmooth analysis
- Cores of Tangent Cones and Clarke's Tangent Cone
- Convex Subcones of the Contingent Cone in Nonsmooth Calculus and Optimization
- On conditions to have bounded multipliers in locally lipschitz programming
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- Differential Stability in Nonlinear Programming
- 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
- Constraint Qualifications Revisited
