Convexificators and strong Kuhn-Tucker conditions
From MaRDI portal
(Redirected from Publication:692289)
Recommendations
- Convexificators and boundedness of the Kuhn-Tucker multipliers set
- Multiobjective problems: enhanced necessary conditions and new constraint qualifications through convexificators
- Nonsmooth multiobjective programming and constraint qualifications
- Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
Cites work
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1214046 (Why is no real title available?)
- scientific article; zbMATH DE number 1568958 (Why is no real title available?)
- scientific article; zbMATH DE number 823381 (Why is no real title available?)
- A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- A generalized derivative for calm and stable functions
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Convexifactors, generalized convexity and vector optimization
- Hunting for a smaller convex subdifferential
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- On constraint qualification in multiobjective optimization problems: Semidifferentiable case
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
Cited in
(31)- Strong KKT, Second Order Conditions and Non-solid Cones in Vector Optimization
- On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
- Robustness in nonsmooth nonconvex optimization problems
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Optimality conditions and duality for interval-valued optimization problems using convexifactors
- Optimality conditions for multiobjective fractional programming, via convexificators
- Multiobjective problems: enhanced necessary conditions and new constraint qualifications through convexificators
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- Improved enhanced Fritz John condition and constraints qualifications using convexificators
- Kuhn–Tucker Conditions for a Convex Programming Problem in Banach Spaces Partially Ordered by Cone with Empty Interior
- Nondifferentiable minimax programming problems with applications
- Constraint qualifications and proper Pareto optimality conditions for multiobjective problems with equilibrium constraints
- Applying directional upper semi-regular convexificators in bilevel optimization
- Strong KKT conditions for optimization problems under a class of Abadie constraint specifications
- On quasiconvex multiobjective optimization and variational inequalities using Greenberg-Pierskalla based generalized subdifferentials
- On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- On interval-valued vector variational-like inequalities and vector optimization problems with generalized approximate invexity via convexificators
- Constraint qualifications and optimality conditions for nonsmooth multiobjective mathematical programming problems with vanishing constraints on Hadamard manifolds via convexificators
- Optimality conditions for nonsmooth semidefinite programming via convexificators
- On the applications of nonsmooth vector optimization problems to solve generalized vector variational inequalities using convexificators
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
- Optimality conditions for isolated local minimum of nonsmooth multiobjective problems
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- On multiobjective optimization problems involving higher order strong convexity using directional convexificators
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Constraint qualifications and optimality conditions in nonsmooth locally star-shaped optimization using convexificators
- Some kind of Pareto stationarity for multiobjective problems with equilibrium constraints
- Convexificators and boundedness of the Kuhn-Tucker multipliers set
- Necessary efficiency conditions for vector equilibrium problems with general inequality constraints via convexificators
This page was built for publication: Convexificators and strong Kuhn-Tucker conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692289)
