首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
Summary It is proved that if the nonempty intersection of bounded closed convex sets AnB is contained in (A + F)U(B+F) and one of the following holds true: (i) the space X is less-than-three dimensional, (ii) AUB is convex, (iii) F is a one-point set, then AnBCA+F or AnBCB+F (Theorems 2 and 3). Moreover, under some hypotheses the characterization of A and B such that AnB is a summand of AUB is given (Theorem 3).  相似文献   

2.
3.
Summary In the paper we consider, from a topological point of view, the set of all continuous functionsf:I I for which the unique continuous solution:I – [0, ) of(f(x)) (x, (x)) and(x, (x)) (f(x)) (x, (x)), respectively, is the zero function. We obtain also some corollaries on the qualitative theory of the functional equation(f(x)) = g(x, (x)). No assumption on the iterative behaviour off is imposed.  相似文献   

4.
We study variational formulas for maximizers for domain functionalsF(x0, u(x0)), x0, and F(x,u(x))dxover all Lipschitz domains satisfying the constraintg(x) dx=1. Here, u is the solution ofa diffusion equation in . Functional variations arecomputed using domain variations which preserve the constraint exactly. Weshow that any maximizer solves a moving boundary problem for the diffusionequation. Further, we show that, for problems with symmetry, the optimaldomains are balls.  相似文献   

5.
, . . .

The authors wish to thank the referee whose comments improved the presentation of the paper. In fact, the present form of Lemma 2, which was originally very long, is due to the referee.  相似文献   

6.
We give efficiency estimates for proximal bundle methods for finding f*minXf, where f and X are convex. We show that, for any accuracy <0, these methods find a point xkX such that f(xk)–f* after at most k=O(1/3) objective and subgradient evaluations.  相似文献   

7.
Let {X k , 1 k n} be n independent and real-valued random variables with common subexponential distribution function, and let {k, 1 k n} be other n random variables independent of {X k , 1 k n} and satisfying a k b for some 0 < a b < for all 1 k n. This paper proves that the asymptotic relations P (max1 m n k=1 m k X k > x) P (sum k=1 n k X k > x) sum k=1 n P ( k X k > x) hold as x . In doing so, no any assumption is made on the dependence structure of the sequence { k , 1 k n}. An application to ruin theory is proposed.  相似文献   

8.
9.
10.
11.
X(Y) f -:X(Y)={fM(×): fX(Y)=f(x,.)YX< . =(0, ), M (×) — , ×, X, Y, Z— . X(Y) Z(×).  相似文献   

12.
    
( « . III») - B p,q g(x) F p,q g(x) ( ) R n . --, . : , , , .  相似文献   

13.
[Zho2] {x n } , n 0 n .

Supported in part by an NSERC Postdoctoral Fellowship and a CRF grant of University of Alberta.  相似文献   

14.
, . . Q k [0,2],k=1,2, — . F(x, y)L(T), T=[0, 2]2, G(x, y)L(T) , G(x,y)=F(x,y) Q=Q 1 ×Q 2 - .  相似文献   

15.
16.
17.
For classes of formulas containing at most two atomic sub-formulas the decision problem of first-order predicate logic with identity and function variables is treated. The class of all formulas of the form Q ( ), where Q is prefix and , are atomic formulas or negated atomic formulas, is decidable with respect to satisfiability. The class of all formulas of the form x1...x6( ) is a conservative reduction class and therefore is undecidable.

Dieser Aufsatz beruht auf Resultaten der Dissertation [13], die der Universität München im Sommersemester 1976 vorgelegt wurde.  相似文献   

18.
We consider the method for constrained convex optimization in a Hilbert space, consisting of a step in the direction opposite to an k -subgradient of the objective at a current iterate, followed by an orthogonal projection onto the feasible set. The normalized stepsizes k are exogenously given, satisfying k=0 k = , k=0 k 2 < , and k is chosen so that k k for some > 0. We prove that the sequence generated in this way is weakly convergent to a minimizer if the problem has solutions, and is unbounded otherwise. Among the features of our convergence analysis, we mention that it covers the nonsmooth case, in the sense that we make no assumption of differentiability off, and much less of Lipschitz continuity of its gradient. Also, we prove weak convergence of the whole sequence, rather than just boundedness of the sequence and optimality of its weak accumulation points, thus improving over all previously known convergence results. We present also convergence rate results. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Research of this author was partially supported by CNPq grant nos. 301280/86 and 300734/95-6.  相似文献   

19.
A new discrete modulus of continuity is introduced for functions of boundedp-fluctuation, and direct and converse theorems are proved on the approximation of these functions by polynomials with respect to multiplicative systems. Sufficient conditions for the convergence of Fourier series with respect to multiplicative systems are also obtained and these are the best possible in a certain sense.

. 60-  相似文献   

20.
[0,1], - H .

This paper was written during the author's scholarship at the State University of Odessa in the USSR.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号