نتایج جستجو برای: michel penot subdifferential
تعداد نتایج: 8128 فیلتر نتایج به سال:
L’animal « habite là où nous habitons et il », rappelle Anne Simon dans un entretien avec Olivier Penot-Lacassagne. Proche incommensurable à la fois, cette altérité intrusive » impose changement de plan pour être exprimée. La zoopoétique, définie comme une poétique des vivants qui se déploie même le monde, est transdisciplinaire ; littérature animalière ne résume pas. Elle construit dialogue co...
In this paper, we establish characterizations of Asplund spaces in terms of conditions ensuring the metric inequality and intersection formulae. Then we establish chain rules for the limiting Fréchet subdifferentials. Necessary conditions for constrained optimization problems with non-Lipschitz data are derived.
References [1] Patrice Quinton and Yves Robert. Algorithmes et architectures systoliques. Etudes et Recherches en Informatique. Masson, 1989. English translation: Systolic algorithms and architectures, Prentice Hall (1991). [2] Yves Robert. The impact of vector and parallel architectures on the Gaussian elimination algorithm. Manchester University Press and John Wiley, 1991. [3] Luc Bougé, Clai...
Primary Panel: Heather Ross (Co-Chair), Paul Hendry (Co-Chair), Anne Dipchand, Nadia Giannetti, Greg Hirsch, Debra Isaac, Narendra Singh, Lori West, Michel White Secondary Panel: Andrew Ignaszewski, Anton Maria Chung, Lynn Straatman, Dennis Modry, Wayne Tymchak, Jeffrey Burton, Wayne Warnica, Jose Eduardo Azevedo, William Kostuk, Alan Menkis, Peter Pflugfelder, Mackenzie Quantz, Ross Davies, He...
Purpose – Deaccessioning, the deliberate culling, disposing, or selling of books from a collection, is one of the most controversial aspects of the collection development function of the library. This article aims to examine what can become of this universe of deaccessioned books through a consideration of two alternative libraries, or libraries-which-are-not-libraries. The existence of such al...
In this paper, we consider a bilevel vector optimization problem where objective and constraints are set valued maps. Our approach consists of using a support function [1, 2, 3, 14, 15, 32] together with the convex separation principle for the study of necessary optimality conditions for D.C bilevel set valued optimization problems. We give optimality conditions in terms of the strong subdiffer...
Let C be a nonempty closed subset of the real normed linear space X. In this paper we determine the extent to which formulas for the Clarke subdifferential of the distance for C, de(x) := inf I/Y.rll, be< which are valid when C is convex, remain valid when C is not convex. The assumption of subdifferential regularity for d, plays an important role. When x 4 C, the most precise results also requ...
It is shown that a locally Lipschitz function is approximately convex if, and only if, its Clarke subdifferential is a submonotone operator. Consequently, in finite dimensions, the class of locally Lipschitz approximately convex functions coincides with the class of lower-C functions. Directional approximate convexity is introduced and shown to be a natural extension of the class of lower-C fun...
This paper is devoted to the so-called pessimistic version of bilevel programming programs. Minimization problems of this type are challenging to handle partly because the corresponding value functions are often merely upper (while not lower) semicontinuous. Employing advanced tools of variational analysis and generalized differentiation, we provide rather general frameworks ensuring the Lipsch...
This paper concerns the second-order generalized differentiation theory of variational analysis and new applications of this theory to some problems of constrained optimization in finitedimensional spaces. The main focus is the so-called (full and partial) second-order subdifferentials of extended-real-valued functions, which are dual-type constructions generated by coderivatives of first-order...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید