Characterization of nonsmooth functions through their generalized gradients

DOI10.1080/02331939108843678zbMath0734.49005OpenAlexW2064148076MaRDI QIDQ3361463

Rachid Ellaia, Abdelhak Hassouni

Publication date: 1991

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939108843678

zbMATH Keywords

difference of convex functionsnonsmooth analysisClarke's generalized gradientreal-valued locally Lipschitz functions

Mathematics Subject Classification ID

Nonsmooth analysis (49J52)

Related Items (26)

Another characterization of convexity for set-valued maps ⋮ Generalized monotonicity and generalized convexity ⋮ Lipschitz B-vex functions and nonsmooth programming ⋮ Characterisations of quasiconvex functions ⋮ On generalised convex nonsmooth functions ⋮ Generalized monotonicity of subdifferentials and generalized convexity ⋮ Generalized convexity of functions and generalized monotonicity of set-valued maps ⋮ Optimality conditions for maximizing a locally Lipschitz function ⋮ A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential ⋮ Quasimonotone Multifunctions; Applications to Optimality Conditions in Quasiconvex Programming ⋮ On the maximization of (not necessarily) convex functions on convex sets ⋮ Positive definiteness of high-order subdifferential and high-order optimality conditions in vector optimization problems ⋮ Characterization and recognition of d.c. functions ⋮ Characterization of d.c. Functions in terms of quasidifferentials ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Sufficient conditions for generalized convex set-valued maps ⋮ Some remarks on the class of continuous (semi-)strictly quasiconvex functions ⋮ A note on characterization of solution sets to pseudolinear programming problems ⋮ Subdifferential representation formula and subdifferential criteria for the behavior of nonsmooth functions ⋮ Regularity Conditions and Optimality in Vector Optimization ⋮ Characterization of scalar quasiconvexity and convexity of locally lipschitz vector-valued maps ⋮ What is quasiconvex analysis? ⋮ Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion ⋮ Set-valued mapping monotonicity as characterization of D.C functions ⋮ Protoconvex functions ⋮ Small convex-valued subdifferentials in mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The conjugate of the difference of convex functions
• Generalized gradients of Lipschitz functionals
• Nine kinds of quasiconcavity and concavity
• Calcul sous-différentiel et optimisation
• Strong and Weak Convexity of Sets and Functions
• On quasidifferentiable mappings
• Optimization and nonsmooth analysis
• Minimization of a quasi-differentiable function in a quasi-differentiable set
• Quasimonotone Multifunctions; Applications to Optimality Conditions in Quasiconvex Programming
• Semismooth and Semiconvex Functions in Constrained Optimization
• Convex Analysis
• Sufficient conditions for extremum, penalty functions and regularity

This page was built for publication: Characterization of nonsmooth functions through their generalized gradients