Hunting for a smaller convex subdifferential
From MaRDI portal
Publication:1359128
DOI10.1023/A:1008246130864zbMath0872.90083OpenAlexW151120512MaRDI QIDQ1359128
V. F. Dem'yanov, Vaithilingam Jeyakumar
Publication date: 5 October 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008246130864
Related Items
Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) ⋮ Optimality conditions and duality for interval-valued optimization problems using convexifactors ⋮ Optimality conditions for pessimistic bilevel problems using convexificator ⋮ Necessary optimality conditions in terms of convexificators in Lipschitz optimization ⋮ Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case ⋮ Convexificators and boundedness of the Kuhn–Tucker multipliers set ⋮ From quasidifferentiable to directed subdifferentiable functions: exact calculus rules ⋮ Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications ⋮ Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators ⋮ Optimality conditions for maximizing a locally Lipschitz function ⋮ A study on vector variational-like inequalities using convexificators and application to its bi-level form ⋮ Convex difference criteria for the quantitative stability of parametric quasidifferentiable systems ⋮ Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators ⋮ Optimality conditions for mathematical programs with equilibrium constraints using directional convexificators ⋮ Applying directional upper semi-regular convexificators in bilevel optimization ⋮ Metric regularity of quasidifferentiable mappings and optimality conditions for nonsmooth mathematical programming problems ⋮ Optimality conditions for optimistic bilevel programming problem using convexifactors ⋮ \(E\)-subdifferential of \(E\)-convex functions and its applications to minimization problem ⋮ Optimality conditions for MPECs in terms of directional upper convexifactors ⋮ Necessary and sufficient optimality conditions for fractional multi-objective problems ⋮ Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem ⋮ Optimality and duality results for bilevel programming problem using convexifactors ⋮ Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem ⋮ Necessary optimality conditions for bilevel set optimization problems ⋮ On Computing the Mordukhovich Subdifferential Using Directed Sets in Two Dimensions ⋮ Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators ⋮ A chain rule for upper semicontinuous (CF)-mappings ⋮ A (CF)-mapping of integral functional of locally Lipschitz functions ⋮ Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators ⋮ Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators ⋮ Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization ⋮ Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation ⋮ Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints ⋮ Nonsmooth Optimization ⋮ Necessary and sufficient conditions for efficiency via convexificators ⋮ Convexifactors, generalized convexity and vector optimization ⋮ Convexificators and strong Kuhn-Tucker conditions ⋮ Reducing exhausters ⋮ Softness, sleekness and regularity properties in nonsmooth analysis ⋮ Necessary optimality conditions for bilevel optimization problems using convexificators ⋮ Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization ⋮ Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators ⋮ Exhausters and subdifferentials in non-smooth analysis ⋮ On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators ⋮ Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications ⋮ Optimality conditions of a set valued optimization problem with the help of directional convexificators ⋮ Optimality conditions for multiobjective fractional programming, via convexificators ⋮ Duality for a class of nonsmooth multiobjective programming problems using convexificators ⋮ Nonsmooth calculus, minimality, and monotonicity of convexificators ⋮ Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators ⋮ Optimality and duality for nonsmooth minimax programming problems using convexifactor ⋮ Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions ⋮ Optimality conditions for nonsmooth semidefinite programming via convexificators
