C1,1 vector optimization problems and Riemann derivatives
Caractérisation de la dérivabilité des fonctions à partir de la dérivée directionnelle.
Characterizations of convex vector functions and optimization.
Characterizations of error bounds for lower semicontinuous functions on metric spaces
Refining the variational method introduced in Azé et al. [Nonlinear Anal. 49 (2002) 643-670], we give characterizations of the existence of so-called global and local error bounds, for lower semicontinuous functions defined on complete metric spaces. We thus provide a systematic and synthetic approach to the subject, emphasizing the special case of convex functions defined on arbitrary Banach spaces (refining the abstract part of Azé and Corvellec [SIAM J. Optim. 12 (2002) 913-927], and the characterization...
Characterizations of error bounds for lower semicontinuous functions on metric spaces
Refining the variational method introduced in Azé et al. [Nonlinear Anal. 49 (2002) 643-670], we give characterizations of the existence of so-called global and local error bounds, for lower semicontinuous functions defined on complete metric spaces. We thus provide a systematic and synthetic approach to the subject, emphasizing the special case of convex functions defined on arbitrary Banach spaces (refining the abstract part of Azé and Corvellec [SIAM J. Optim. 12 (2002) 913-927], and the characterization...
Characterizations of generalized monotone nonsmooth continuous maps using approximate Jacobians.
Characterizations of the Solution Sets of Generalized Convex Minimization Problems
2000 Mathematics Subject Classification: 90C26, 90C20, 49J52, 47H05, 47J20.In this paper we obtain some simple characterizations of the solution sets of a pseudoconvex program and a variational inequality. Similar characterizations of the solution set of a quasiconvex quadratic program are derived. Applications of these characterizations are given.
Characterizations of ɛ-duality gap statements for constrained optimization problems
In this paper we present different regularity conditions that equivalently characterize various ɛ-duality gap statements (with ɛ ≥ 0) for constrained optimization problems and their Lagrange and Fenchel-Lagrange duals in separated locally convex spaces, respectively. These regularity conditions are formulated by using epigraphs and ɛ-subdifferentials. When ɛ = 0 we rediscover recent results on stable strong and total duality and zero duality gap from the literature.
Clarke critical values of subanalytic Lipschitz continuous functions
The main result of this note asserts that for any subanalytic locally Lipschitz function the set of its Clarke critical values is locally finite. The proof relies on Pawłucki's extension of the Puiseux lemma. In the last section we give an example of a continuous subanalytic function which is not constant on a segment of "broadly critical" points, that is, points for which we can find arbitrarily short convex combinations of gradients at nearby points.
Coerciveness property for a class of non-smooth functionals.
Coercivity of set-valued mappings on metric spaces.
Coercivity properties for order nonsmooth functionals.
Compactly epi-Lipschitzian convex sets and functions in normed spaces.
Compensated convexity and its applications
Complément de Schur et sous-différentiel du second ordre d'une fonction convexe.
Complements, approximations, smoothings and invariance properties.
Composite semi-infinite optimization
Critical point theorems for nonlinear dynamical systems and their applications.