Convexificators and strong Kuhn-Tucker conditions
From MaRDI portal
Publication:692289
DOI10.1016/J.CAMWA.2011.12.047zbMATH Open1252.90073OpenAlexW2067239116MaRDI QIDQ692289FDOQ692289
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
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
nonsmooth optimizationoptimality conditionsmultiobjective programmingconstraint qualificationconvexificator
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Title not available (Why is that?)
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- Convexifactors, generalized convexity and vector optimization
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
- Title not available (Why is that?)
- On constraint qualification in multiobjective optimization problems: Semidifferentiable case
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Title not available (Why is that?)
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- Title not available (Why is that?)
- A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
Cited In (27)
- Optimality Conditions for Isolated Local Minimum of Nonsmooth Multiobjective Problems
- 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
- On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- Convexificators and boundedness of the Kuhn–Tucker multipliers set
- Kuhn–Tucker Conditions for a Convex Programming Problem in Banach Spaces Partially Ordered by Cone with Empty Interior
- Nondifferentiable minimax programming problems with applications
- Applying directional upper semi-regular convexificators in bilevel optimization
- Constraint qualifications and proper Pareto optimality conditions for multiobjective problems with equilibrium constraints
- 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
- 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 nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Some kind of Pareto stationarity for multiobjective problems with equilibrium constraints
- Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators
- Necessary efficiency conditions for vector equilibrium problems with general inequality constraints via convexificators
- Strong KKT, Second Order Conditions and Non-solid Cones in Vector Optimization
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)
