Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6508502
- Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- Necessary and sufficient conditions for weak quasi Efficiency in nonsmooth multiobjective problems
- Optimality conditions for efficiency on nonsmooth multiobjective programming problems
Cites work
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 1779286 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3354101 (Why is no real title available?)
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Constraint qualifications in nonsmooth multiobjective optimization
- Convex Analysis
- Convex analysis and nonlinear optimization. Theory and examples
- Error bounds for generalized Lagrange multipliers in locally Lipschitz programming
- Infine functions, nonsmooth alternative theorems and vector optimization problems
- Maximal vectors and multi-objective optimization
- Multiobjective Problems with Nonsmooth Equality Constraints
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Necessary conditions for super minimizers in constrained multiobjective optimization
- Necessary conditions in multiobjective optimization with equilibrium constraints
- Nonlinear Programming
- On constraint qualification in multiobjective optimization problems: Semidifferentiable case
- On constraint qualifications in nonsmooth optimization.
- Optimality conditions for directionally differentiable multi-objective programming problems
- Optimality conditions in multiobjective differentiable programming
- Optimality criteria for nonsmooth continuous-time problems of multiobjective optimization
- Regularity conditions in vector optimization
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Scalarization in vector optimization
- Scalarization of vector optimization problems
- Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
- Variational principles for set-valued mappings with applications to multiobjective optimization
Cited in
(20)- Optimality conditions for efficiency on nonsmooth multiobjective programming problems
- Convexificators and boundedness of the Kuhn-Tucker multipliers set
- Necessary and sufficient conditions for weak quasi Efficiency in nonsmooth multiobjective problems
- Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency
- Constraint qualifications in nonsmooth multiobjective optimization
- Nonsmooth multiobjective programming and constraint qualifications
- Approximate solutions to nonsmooth multiobjective programming problems
- Sensitivity analysis of the value function for nonsmooth optimization problems
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- A note on second-order Karush-Kuhn-Tucker necessary optimality conditions for smooth vector optimization problems
- On Abadie constraint qualification for multiobjective optimization problems
- Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization
- On Tucker-type alternative theorems and necessary optimality conditions for nonsmooth multiobjective optimization
- Strong second-order Karush-Kuhn-Tucker optimality conditions for vector optimization
- Optimality conditions for nonsmooth semidefinite programming via convexificators
- Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
- scientific article; zbMATH DE number 6508502 (Why is no real title available?)
- Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones
- Optimality conditions for isolated local minimum of nonsmooth multiobjective problems
- A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems
This page was built for publication: Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q369642)
