Convexificators and necessary conditions for efficiency
From MaRDI portal
Publication:5413888
DOI10.1080/02331934.2011.648636zbMath1321.90150OpenAlexW1964259670MaRDI QIDQ5413888
Publication date: 2 May 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.648636
constraint qualificationsupper convexificatorsFritz-John necessary conditions for efficiencyKuhn-Tucker necessary conditions for efficiencyupper semi-regular convexificators
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Optimality conditions and duality for interval-valued optimization problems using convexifactors ⋮ On variational inequalities using directional convexificators ⋮ Contingent derivatives and necessary efficiency conditions for vector equilibrium problems with constraints ⋮ Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications ⋮ Optimality and duality in constrained interval-valued optimization ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ Efficiency conditions for multiobjective bilevel programming problems via convexificators ⋮ Necessary and sufficient conditions for efficiency via convexificators ⋮ Unnamed Item ⋮ On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators ⋮ Optimality conditions of a set valued optimization problem with the help of directional convexificators ⋮ Optimality conditions for multiobjective fractional programming, via convexificators
Cites Work
- Convexifactors, generalized convexity, and optimality conditions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Multiplier Rules Under Mixed Assumptions of Differentiability and Lipschitz Continuity
- Necessary conditions for efficiency in terms of the Michel–Penot subdifferentials
- On alternative theorems and necessary conditions for efficiency
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Convexifactors, generalized convexity and vector optimization
- A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
- On constraint qualifications in directionally differentiable multiobjective optimization problems
- Implicit Functions and Optimization Problems without Continuous Differentiability of the Data
