نتایج جستجو برای: convex analysis

تعداد نتایج: 2866908  

Journal: :SIAM Journal on Optimization 2011
Chong Li K. F. Ng

Extending and improving some recent results of Hantoute, López, and Zălinescu and others, we provide characterization conditions for subdifferential formulas to hold for the supremum function of a family of convex functions on a real locally convex space.

2007
Kazuo MUROTA

The present knowledge about L-convex and M-convex functions are surveyed on the basis of [27].

2014
Si-Huan Li Shu Xu Qun Lin

and Applied Analysis 3 Furthermore, if h is a convex function, then ∂ c h(?̂?) is in accordance with the subdifferential ∂h(?̂?) in convex analysis; that is,

H. Liu S. Wang W. Fan

In this paper, we first characterize the convex $L$-subgroup of an $L$-ordered group by means of fourkinds of cut sets of an $L$-subset. Then we consider the homomorphic preimages and the product of convex $L$-subgroups.After that, we introduce an $L$-convex structure constructed by convex $L$-subgroups.Furthermore, the notion of the degree to which an $L$-subset of an $L$-ord...

This paper presents ‎‎the optimization techniques for solving‎‎ convex programming problems with hybrid constraints‎.‎ According to the saddle point theorem‎, ‎optimization theory‎, ‎convex analysis theory‎, ‎Lyapunov stability theory and LaSalle‎‎invariance principle‎,‎ a neural network model is constructed‎.‎ The equilibrium point of the proposed model is proved to be equivalent to the optima...

Journal: :international journal of nonlinear analysis and applications 2015
madjid eshaghi hamidreza reisi dezaki alireza moazzen

‎let $x$ be a real normed  space, then  $c(subseteq x)$  is  functionally  convex  (briefly, $f$-convex), if  $t(c)subseteq bbb r $ is  convex for all bounded linear transformations $tin b(x,r)$; and $k(subseteq x)$  is  functionally   closed (briefly, $f$-closed), if  $t(k)subseteq bbb r $ is  closed  for all bounded linear transformations $tin b(x,r)$. we improve the    krein-milman theorem  ...

Journal: :SIAM Journal on Optimization 2008
Abderrahim Hantoute Marco A. López Constantin Zalinescu

We provide a rule to calculate the subdifferential of the pointwise supremum of an arbitrary family of convex functions defined on a real locally convex topological vector space. Our formula is given exclusively in terms of the data functions, and does not require any assumption either on the index set on which the supremum is taken or on the involved functions. Some other calculus rules, namel...

Journal: :IEEE Transactions on Signal Processing 2017

Journal: :Nonlinear Analysis: Theory, Methods & Applications 2000

Journal: :Journal of Global Optimization 2006

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید