Pages that link to "Item:Q1359128"

The following pages link to Hunting for a smaller convex subdifferential (Q1359128):

Displaying 50 items.

• Optimality conditions and duality for interval-valued optimization problems using convexifactors (Q276276) (← links)
• From quasidifferentiable to directed subdifferentiable functions: exact calculus rules (Q346799) (← links)
• Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications (Q346826) (← links)
• Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators (Q346833) (← links)
• Optimality conditions for optimistic bilevel programming problem using convexifactors (Q415386) (← links)
• Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization (Q505143) (← links)
• Optimality and duality results for bilevel programming problem using convexifactors (Q637559) (← links)
• Convexificators and strong Kuhn-Tucker conditions (Q692289) (← links)
• Optimality conditions for multiobjective fractional programming, via convexificators (Q781069) (← links)
• Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) (Q819950) (← links)
• Optimality conditions for pessimistic bilevel problems using convexificator (Q830345) (← links)
• Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case (Q850828) (← links)
• Convex difference criteria for the quantitative stability of parametric quasidifferentiable systems (Q878248) (← links)
• Necessary optimality conditions for bilevel set optimization problems (Q925230) (← links)
• Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization (Q987521) (← links)
• The differentiability of real functions on normed linear space using generalized subgradients (Q1102500) (← links)
• Nonsmooth calculus, minimality, and monotonicity of convexificators (Q1301893) (← links)
• Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators (Q1730476) (← links)
• A study on vector variational-like inequalities using convexificators and application to its bi-level form (Q2171112) (← links)
• Metric regularity of quasidifferentiable mappings and optimality conditions for nonsmooth mathematical programming problems (Q2194602) (← links)
• Necessary and sufficient conditions for efficiency via convexificators (Q2251552) (← links)
• Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications (Q2311117) (← links)
• Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming (Q2342953) (← links)
• Optimality conditions for nonsmooth semidefinite programming via convexificators (Q2355132) (← links)
• Necessary optimality conditions in terms of convexificators in Lipschitz optimization (Q2370062) (← links)
• A chain rule for upper semicontinuous (CF)-mappings (Q2457915) (← links)
• A (CF)-mapping of integral functional of locally Lipschitz functions (Q2460114) (← links)
• Reducing exhausters (Q2481120) (← links)
• Softness, sleekness and regularity properties in nonsmooth analysis (Q2482485) (← links)
• Necessary optimality conditions for bilevel optimization problems using convexificators (Q2494307) (← links)
• Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem (Q2691214) (← links)
• Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators (Q2790868) (← links)
• On Computing the Mordukhovich Subdifferential Using Directed Sets in Two Dimensions (Q2995263) (← links)
• Necessary and sufficient optimality conditions for fractional multi-objective problems (Q3514832) (← links)
• Nonsmooth Optimization (Q3569504) (← links)
• Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions (Q4239803) (← links)
• Convexificators and boundedness of the Kuhn–Tucker multipliers set (Q4559391) (← links)
• Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators (Q4639187) (← links)
• Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation (Q4646549) (← links)
• Convexifactors, generalized convexity and vector optimization (Q4656060) (← links)
• Optimality conditions of a set valued optimization problem with the help of directional convexificators (Q4986414) (← links)
• Duality for a class of nonsmooth multiobjective programming problems using convexificators (Q5005490) (← links)
• Optimality and duality for nonsmooth minimax programming problems using convexifactor (Q5020437) (← links)
• Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem (Q5131829) (← links)
• Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators (Q5147635) (← links)
• Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints (Q5162595) (← links)
• On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators (Q5214425) (← links)
• Optimality conditions for maximizing a locally Lipschitz function (Q5317734) (← links)
• Exhausters and subdifferentials in non-smooth analysis (Q5449010) (← links)
• Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators (Q5865281) (← links)