首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 109 毫秒
1.
吴伟志 《数学研究》1998,31(3):244-247
讨论了赋范空间中度量投影的收敛性.得到了在局部紧集控制下.Chebyshov凸集序列的度量投影的收敛性与K-M收敛,Wlisman收敛和Kuratowskl收敛都等价.本文的结论完善了M.Tsukada在[1]和[2]的结果.  相似文献   

2.
一类新的共轭投影梯度算法   总被引:2,自引:0,他引:2  
本文利用[5]引进的共轭投影的概念,结合堵丁柱[3]中的思想,提出一类新的共轭梯度投影算法.在一定的条件下,证明了该算法具有全局收敛性和超线性收敛速度.  相似文献   

3.
正则F集空间中的度量拓扑   总被引:1,自引:1,他引:0  
本文证明了R^n上正则F集收敛拓扑空间是完备的、可分的度量空间,给出了该种度量的具体表达形式。本文还讨论了弱收敛度量拓扑与正则F集上另外两种度量拓扑-一致收敛拓扑及积分收敛拓扑-之间的关系。  相似文献   

4.
本文研究了不分明集的一些级数收敛性,给出了不分明集的oX-级数收敛定义及oS-序列紧致性.证明了一个在论域上逐点收敛的模订级数,将在某种中的拓扑下,也可以是收敛的.如论域X为紧度量空间,且Ai∈F(X)∩ C(X)时,级数依距离d(A,B)=收敛.  相似文献   

5.
定向集上的B值一致渐近鞅   总被引:3,自引:0,他引:3  
本文将文献[1]、[2]关于序列情形下的B值一致渐近的概念拓广到定向集的情形,给出了定向集上B值鞅的一个可选采样定理,证明了定向集上B值一致渐近鞅的Riesz分解定理。同时,用B值一致渐近鞅的收敛性及其诱导测度刻划了B空间的R-N性质,最后还给出了一个B值一致渐近鞅本性收敛的充分条件。  相似文献   

6.
一族超线性收敛的投影拟牛顿算法   总被引:5,自引:0,他引:5  
本文将梯度投影与拟牛顿法相结合,给出了求解一般线性约束非线性规划问题含两组参数的算法族.在一定的条件下证明了算法族的全局收敛性与它的子族的超线性收敛速度,并给出了投影D.F.P方法、投影BFGS方法等一些特例.  相似文献   

7.
蔡光辉 《应用数学》2002,15(3):106-110
本文讨论了不同分布NA随机变量序列加权和的完全收敛性,获得了较[7]中的定理1及定理A更为一般的安全收敛性,并得到了完全收敛速度与矩条件之间的等价关系。  相似文献   

8.
基于修正拟牛顿方程,利用Goldstein-Levitin-Polyak(GLP)投影技术,建立了求解带凸集约束的优化问题的两阶段步长非单调变尺度梯度投影算法,证明了算法的全局收敛性和一定条件下的Q超线性收敛速率.数值结果表明新算法是有效的,适合求解大规模问题.  相似文献   

9.
本文研究了不分明集的一些级数收敛性,给出了不分明集的σX-级数收敛定义及σS-序列紧致性。证明了一个在论域上逐点收敛的模订级数,将在某种中的拓扑下,也可以是收敛的。如论域X为紧度量空间,且Ai∈F(X)∩C(X)时,级数∑i=1^∞Ai依距离d(A,B)=supx∈X│A(x)-B(x)│收敛。  相似文献   

10.
研究复Fuzzy数列科技的收敛性,讨论复Fuzzy数列度量收敛与水平收敛的等价性问题。为复Fuzzy分析的进一上研究打下良好的基础。  相似文献   

11.
In 1883 Arzelà (1983/1984) [2] gave a necessary and sufficient condition via quasi-uniform convergence for the pointwise limit of a sequence of real-valued continuous functions on a compact interval to be continuous. Arzelà's work paved the way for several outstanding papers. A milestone was the P.S. Alexandroff convergence introduced in 1948 to tackle the question for a sequence of continuous functions from a topological space (not necessarily compact) to a metric space. In 2009, in the realm of metric spaces, Beer and Levi (2009) [10] found another necessary and sufficient condition through the novel notion of strong uniform convergence on finite sets. We offer a direct proof of the equivalence of Arzelà, Alexandroff and Beer-Levi conditions. The proof reveals the internal gear of these important convergences and sheds more light on the problem. We also study the main properties of the topology of strong uniform convergence of functions on bornologies, initiated in Beer and Levi (2009) [10].  相似文献   

12.
We examine when a sequence of lsc convex functions on a Banach space converges uniformly on bounded sets (resp. compact sets) provided it converges Attouch-Wets (resp. Painlevé-Kuratowski). We also obtain related results for pointwise convergence and uniform convergence on weakly compact sets. Some known results concerning the convergence of sequences of linear functionals are shown to also hold for lsc convex functions. For example, a sequence of lsc convex functions converges uniformly on bounded sets to a continuous affine function provided that the convergence is uniform on weakly compact sets and the space does not contain an isomorphic copy of .

  相似文献   


13.
The method of projections onto convex sets to find a point in the intersection of a finite number of closed convex sets in a Euclidean space, may lead to slow convergence of the constructed sequence when that sequence enters some narrow “corridor” between two or more convex sets. A way to leave such corridor consists in taking a big step at different moments during the iteration, because in that way the monotoneous behaviour that is responsible for the slow convergence may be interrupted. In this paper we present a technique that may introduce interruption of the monotony for a sequential algorithm, but that at the same time guarantees convergence of the constructed sequence to a point in the intersection of the sets. We compare experimentally the behaviour concerning the speed of convergence of the new algorithm with that of an existing monotoneous algorithm.  相似文献   

14.
Two distributed algorithms are described that enable all users connected over a network to cooperatively solve the problem of minimizing the sum of all users’ objective functions over the intersection of all users’ constraint sets, where each user has its own private nonsmooth convex objective function and closed convex constraint set, which is the intersection of a number of simple, closed convex sets. One algorithm enables each user to adjust its estimate using the proximity operator of its objective function and the metric projection onto one constraint set randomly selected from a number of simple, closed convex sets. The other determines each user’s estimate using the subdifferential of its objective function instead of the proximity operator. Investigation of the two algorithms’ convergence properties for a diminishing step-size rule revealed that, under certain assumptions, the sequences of all users generated by each of the two algorithms converge almost surely to the same solution. It also showed that the rate of convergence depends on the step size and that a smaller step size results in quicker convergence. The results of numerical evaluation using a nonsmooth convex optimization problem support the convergence analysis and demonstrate the effectiveness of the two algorithms.  相似文献   

15.
Earlier results on weak convergence to diffusion processes [8] are generalized to cases where the limiting diffusions may have regular boundaries. The boundaries may be adhesive or reflecting, and in each case we give two different sets of conditions for convergence. It is shown that these conditions are necessary and sufficient for convergence in the same sense as the conditions in [8]. We also extend our results to cases where the coefficients of the diffusions have simple discontinuities, in particular we thereby answer an open question by Keilson and Wellner [9]. Finally we formulate alternative sets of conditions for convergence, with these new sets being more convenient for instance when the sequence under investigation consists of pure jump Markov processes in continuous time.  相似文献   

16.
A class of penalty functions for solving convex programming problems with general constraint sets is considered. Convergence theorems for penalty methods are established by utilizing the concept of infimal convergence of a sequence of functions. It is shown that most existing penalty functions are included in our class of penalty functions.  相似文献   

17.
In this paper, a strong convergence theorem for asymptotically nonexpansive mappings in a uniformly convex and smooth Banach space is proved by using metric projections. This theorem extends and improves the recent strong convergence theorem due to Matsushita and Takahashi [S. Matsushita, W. Takahashi, Approximating fixed points of nonexpansive mappings in a Banach space by metric projections, Appl. Math. Comput. 196 (2008) 422–425] which was established for nonexpansive mappings.  相似文献   

18.
This report contains the proofs of four new theorems relating to the behaviour of Broyden's [1] family of variable metric formula for solving unconstrained minimisation problems. In particular, it is shown that if the linear search at each iteration is perfect, then the sequence of points that is generated is independent of the member of the family used at each iteration, provided the matrix remains nonsingular. This result extends Powell's [14] proof of convergence for the original formula on any convex function to all members of the family.  相似文献   

19.
In this paper, we consider an implicit iteration process to approximate the common fixed points of two finite families of asymptotically quasi-nonexpansive mappings in convex metric spaces. As a consequence of our result, we obtain some related convergence theorems. Our results generalize some recent results of Khan and Ahmed [4], Khan et al. [6], Sun [12], Wittmann [14] and Xu and Ori [15].  相似文献   

20.
Kaleva [9] has studied the relationships between the metric convergencesH andD of fuzzy convex sets on Euclidean spaces. The distanceH between two fuzzy set is given by Hausdorff distance of their sendographs, whileD is the supremum of the Hausdorff distances of the level sets corresponding to the fuzzy sets. The aim of this paper is to compareH andD with the variational convergence, called γ-convergence (see De Giorgi and Franzoni [3]). Our analysis which is carried out in the setting of metric spaces (not necessarily locally compact or vector spaces), improves Kaleva's results.
Sunto Kaleva ha investigato in [9] le relazioni esistenti tra due convergenze metriche, detteH eD, di sottoinsiemi fuzzy di spazi euclidei finito-dimensionali. In questo articolo le convergenzeH eD (la loro definizione dipende dalla distanza di Hausdorff tra insiemi compatti) sono confrontate con la convergenza variazionale, detta γ-convergenza, introdotta da De Giorgi and Franzoni in [3] nel contesto degli spazi topologici. Tale confronto con la γ-convergenza (vedi Teorema 3.7), svolto nell'ambito degli spazi metrici (non necessariamente, localmente compatti o lineari) migliora ed estende i precedenti risultati di Kaleva.
  相似文献   

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

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