نتایج جستجو برای: convex semi
تعداد نتایج: 195136 فیلتر نتایج به سال:
In the main theorem of this paper we show that any involution on the class of lower semi-continuous convex functions which is order-reversing, must be, up to linear terms, the well known Legendre transform.
We give some sufficient conditions for proper lower semicontinuous functions on metric spaces to have error bounds (with exponents). For a proper convex function f on a normed space X the existence of a local error bound implies that of a global error bound. If in addition X is a Banach space, then error bounds can be characterized by the subdifferential of f . In a reflexive Banach space X, we...
We consider the problem min{f(x) : x E G, T(x) tI. int D}, where fis a lower semicontinuous function, G a compact, nonempty set in JRn, D a closed convex set in JR2 with nonempty interior, and T a continuous mapping from JRn to JR2. The constraint T( x) tI. int D is areverse convex constraint, so the feasible domain may be disconnected even when f, T are affine and G is a polytope. We show that...
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalise the correspondence of facets of a polytope with the vertices of the dual polytope to general semi-algebraic convex sets. In this case, exceptional families of extreme points might exist and we characterise them semi-algebraically. We also give a strategy for computing a com...
The objective of this paper is to introduce a general scheme for deriving a posteriori error estimates by using duality theory of the calculus of variations. We consider variational problems of the form inf v∈V {F (v) +G(Λv)}, where F : V → R is a convex lower semicontinuous functional, G : Y → R is a uniformly convex functional, V and Y are reflexive Banach spaces, and Λ : V → Y is a bounded l...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finitely many semi-algebraic convex sets. We establish an explicit convergence rate estimate which relies on the maximum degree of the polynomials that generate the semi-algebraic convex sets and the dimension of the underlying space. We achieve our results by exploiting the algebraic structure of the ...
A class of convex functions where the sets of subdifferentials behave like the unit ball of the dual space of an Asplund space is found. These functions, which we called Asplund functions also possess some stability properties. We also give a sufficient condition for a function to be an Asplund function in terms of the upper-semicontinuity of the subdifferential map.
Theory and applications have shown that there are two important types of convergence for convex functions: pointwise convergence and convergence in a topology induced by the convergence of their epigraphs. We show that these two types of convergence are equivalent on the class of convex functions which are equi-lower semicontinuous. This turns out to be maximal classes of convex functions for w...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید