نتایج جستجو برای: penot subdifferential
تعداد نتایج: 593 فیلتر نتایج به سال:
We investigate some properties related to the generalized Newton method for the Fischer-Burmeister (FB) function over second-order cones, which allows us to reformulate the second-order cone complementarity problem (SOCCP) as a semismooth system of equations. Specifically, we characterize the B-subdifferential of the FB function at a general point and study the condition for every element of th...
In this paper we study necessary optimality conditions for nonsmooth optimization problems with equality, inequality and abstract set constraints. We derive the enhanced Fritz John condition which contains some new information even in the smooth case than the classical enhanced Fritz John condition. From this enhanced Fritz John condition we derive the enhanced Karush-Kuhn-Tucker (KKT) conditio...
Continuing the work of Hiriart-Urruty and Phelps, we discuss (in both locally convex spaces and Banach spaces) the formulas for the conjugates and subdifferentials of the precomposition of a convex function by a continuous linear mapping and the marginal function of a convex function by a continuous linear mapping. We exhibit a certain (incomplete) duality between the operations of precompositi...
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
For a nonsmooth multiobjective mathematical programming problem governed by infinitely many constraints, we define a new gap function that generalizes the definitions of this concept in other articles. Then, we characterize the efficient, weakly efficient, and properly efficient solutions of the problem utilizing this new gap function. Our results are based on $(Phi,rho)-$invexity,...
In this paper we introduce an algorithm for solving variational inequality problems when the operator is pseudomonotone and point-to-set (therefore not relying on continuity assumptions). Our motivation development of a method optimisation appearing in Chebyshev rational generalised approximation problems, where approximations are constructed as ratios linear forms (linear combinations basis fu...
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.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید