首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 93 毫秒
1.
As known,the method to obtain a sequence space by using convergence field of an infinite matrix is an old method in the theory of sequence spaces.However,the study of convergence field of an infinite matrix in the space of almost convergent sequences is so new(see [15]).The purpose of this paper is to introduce the new spaces f and f0 consisting of all sequences whose Cesa`ro transforms of order one are in the spaces f and f0,respectively.Also,in this paper,we show that f and f0 are linearly isomorphic to the spaces f and f0,respectively.The β-and γ-duals of the spaces f and f0 are computed.Furthermore,the classes(f:) and(:f) of infinite matrices are characterized for any given sequence space,and determined the necessary and sufficient conditions on a matrix A to satisfy BC-core(Ax) K-core(x),K-core(Ax) BC-core(x),BC-core(Ax) BC-core(x),BC-core(Ax) st-core(x) for all x ∈∞.  相似文献   

2.
A lower bound on the total signed domination numbers of graphs   总被引:4,自引:0,他引:4  
Let G be a finite connected simple graph with a vertex set V(G)and an edge set E(G). A total signed domination function of G is a function f:V(G)∪E(G)→{-1,1}.The weight of f is W(f)=∑_(x∈V)(G)∪E(G))f(X).For an element x∈V(G)∪E(G),we define f[x]=∑_(y∈NT[x])f(y).A total signed domination function of G is a function f:V(G)∪E(G)→{-1,1} such that f[x]≥1 for all x∈V(G)∪E(G).The total signed domination numberγ_s~*(G)of G is the minimum weight of a total signed domination function on G. In this paper,we obtain some lower bounds for the total signed domination number of a graph G and compute the exact values ofγ_s~*(G)when G is C_n and P_n.  相似文献   

3.
Let G = (V, E) be a finite, simple and undirected graph with p vertices and q edges. An (a, d)-vertex-antimagic total labeling of G is a bijection f from V (G) ∪ E(G) onto the set of consecutive integers 1, 2, . . . , p + q, such that the vertex-weights form an arithmetic progression with the initial term a and difference d, where the vertex-weight of x is the sum of the value f (x) assigned to the vertex x together with all values f (xy) assigned to edges xy incident to x. Such labeling is called super if the smallest possible labels appear on the vertices. In this paper, we study the properties of such labelings and examine their existence for 2r-regular graphs when the difference d is 0, 1, . . . , r + 1.  相似文献   

4.
1. IntroductionA gash G is an ordered pair of disjoillt sets (V, E) such that E is a subset of the setof unordered pairs of V, where the sets V and E are finite. The set V is cajled the setof venices and E is called the set of edges. They are usually denoted by V(G) and E(C),respectively. An edge (x, y) is said to join the venices x and y, and is sometimes denotedby xo or ear. By our definition, a graph does not colltain any loOP, neither does it colltainmultiple edges.Other terms undef…  相似文献   

5.
Let f : U(x0) (?) E→F be a. C1 map and f'(X0) be the Prechet derivative of /fat X0. In local analysis of nonlinear functional analysis, implicit function theorem, inverse function theorem, local surjectivity theorem, local injectivity theorem, and the local conjugacy theorem are well known. Those theorems are established by using the properties: f'(x0) is double splitting and R(f'(x))∩N(T0 ) = {0} near X0. However, in infinite dimensional Banach spaces, f'(x0) is not always double splitting (i.e., the generalized inverse of f'(xo) does not always exist), but its bounded outer inverse of f'(x0) always exists. Only using the C1 map f and the outer inverse T0# of f'(x0), the authors obtain two quasi-local conjugacy theorems, which imply the local conjugacy theorem if X0 is a locally fine point of f. Hence the quasi-local conjugacy theorems generalize the local conjugacy theorem in Banach spaces.  相似文献   

6.
Let f(x) be the density of a design variable X and m(x) = E[Y\X = x] the regression function. Then m(x) - G(x)/f(x), where G(x) = m(x)f(x). The Dirac δ-function is used to define a generalized empirical function Gn (x) for G(x) whose expectation equals G(x). This generalized empirical function exists only in the space of Schwartz distributions, so we introduce a local polynomial of order p approximation to Gn(.) which provides estimators of the function G(x) and its derivatives. The density f(x) can be estimated in a similar manner. The resulting local generalized empirical estimator (LGE) of m(x) is exactly the Nadaraya-Watson estimator at interior points when p = 1, but on the boundary the estimator automatically corrects the boundary effect. Asymptotic normality of the estimator is established. Asymptotic expressions for the mean squared errors are obtained and used in bandwidth selection. Boundary behavior of the estimators is investigated in details. We use Monte Carlo simulations to show that the  相似文献   

7.
Denote by c,(s)the circulant digraph with vertex set zn=[0,1,2……n-1]and symbol set s(≠-s)∈zn\[0].let x be the automorphism group of cn(S)and xo the stabilizer of o in x.then cn(S)is arctransitive if and only if xo acts transitively on s.in this paper,co(S)with xo is being the symmetric group is characterized by its symbot set .by the way all the arctransitive clcculant digraphs of degree 2are given.  相似文献   

8.
Hartman's linearization theorem tells us that if matrix A has no zero real part and f(x) is bounded and satisfies Lipchitz condition with small Lipchitzian constant, then there exists a homeomorphism of Rn sending the solutions of nonlinear system x' = Ax + f(x) onto the solutions of linear system x = Ax. In this paper, some components of the nonlinear item f(x) are permitted to be unbounded and we prove the result of global topological linearization without any special limitation and adding any condition. Thus, Hartman's linearization theorem is improved essentially.  相似文献   

9.
In this paper, we consider unconstrained optimization problem (p) min{f(x)|x∈R~n}, where f(x) is continuously differentiable and the gradient g(x) of f(x) is Lipschitzian on R~n. Suppose sequence {x_i} is generated by BFGS algoritm when it is used to the problem (P) with exact or inexact line searches, i.e., the stepsize α_i satisfy either of the following conditions  相似文献   

10.
有关M.S.Berger问题的注记   总被引:1,自引:0,他引:1  
史平  马吉溥 《东北数学》2003,19(4):366-370
In this paper, we discuss the problem concerning global and local structure of solutions of an operator equation posed by M. S. Berger. Let f : U 真包含 E → F be a C1 map, where E and F are Banach spaces and U is open in E. We show that the solution set of the equation f(x) = y for a fixed generalized regular value y of f is represented as a union of disjoint connected C1 Banach submanifolds of U, each of which has a dimension and its tangent space is given. In particular, a characterization of the isolated solutions of the equation f(x) = y is obtained.  相似文献   

11.
In this paper, based on a simple model of the trust region subproblem, we propose a new self-adaptive trust region method with a line search technique for solving unconstrained optimization problems. By use of the simple subproblem model, the new method needs less memory capacitance and computational complexity. And the trust region radius is adjusted with a new self-adaptive adjustment strategy which makes full use of the information at the current point. When the trial step results in an increase in the objective function, the method does not resolve the subproblem, but it performs a line search technique from the failed point. Convergence properties of the method are proved under certain conditions. Numerical experiments show that the new method is effective and attractive for large-scale optimization problems.  相似文献   

12.
Based on simple quadratic models of the trust region subproblem, we combine the trust region method with the nonmonotone and adaptive techniques to propose a new nonmonotone adaptive trust region algorithm for unconstrained optimization. Unlike traditional trust region method, our trust region subproblem is very simple by using a new scale approximation of the minimizing function??s Hessian. The new method needs less memory capacitance and computational complexity. The convergence results of the method are proved under certain conditions. Numerical results show that the new method is effective and attractive for large scale unconstrained problems.  相似文献   

13.
1.IntroductionIn[6],aQPFTHmethodwasproposedforsolvingthefollowingnonlinearprogrammingproblemwherefunctionsf:R"-- RIandgi:R"-- R',jeJaretwicecontinuouslydifferentiable.TheQPFTHalgorithmwasdevelopedforsolvingsparselarge-scaleproblem(l.l)andwastwo-stepQ-quadraticallyandR-quadraticallyconvergent(see[6]).Theglobalconvergenceofthisalgorithmisdiscussedindetailinthispaper.Forthefollowinginvestigationwerequiresomenotationsandassumptions.TheLagrangianofproblem(1.1)isdefinedbyFOundationofJiangs…  相似文献   

14.
王周宏 《计算数学》2005,27(4):395-404
本文针对大规模无约束优化问题研究了一个新的有限内存信赖域实现方法,提出了一个在有限维(维数≤2m+1)子空间上精确求解信赖域子问题的方法,大大减少了计算量;分析了方法的收敛性,并详细给出了数值计算方法,最后通过数值实验验证了方法的有效性.  相似文献   

15.
The trust region method is an effective approach for solving optimization problems due to its robustness and strong convergence. However, the subproblem in the trust region method is difficult or time-consuming to solve in practical computation, especially in large-scale problems. In this paper we consider a new class of trust region methods, specifically subspace trust region methods. The subproblem in these methods has an adequate initial trust region radius and can be solved in a simple subspace. It is easier to solve than the original subproblem because the dimension of the subproblem in the subspace is reduced substantially. We investigate the global convergence and convergence rate of these methods.  相似文献   

16.
We propose a nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization. Unlike traditional trust region methods, the subproblem in our method is a simple conic model, where the Hessian of the objective function is approximated by a scalar matrix. The trust region radius is adjusted with a new self-adaptive adjustment strategy which makes use of the information of the previous iteration and current iteration. The new method needs less memory and computational efforts. The global convergence and Q-superlinear convergence of the algorithm are established under the mild conditions. Numerical results on a series of standard test problems are reported to show that the new method is effective and attractive for large scale unconstrained optimization problems.  相似文献   

17.
The mean value cross decomposition method for linear programming problems is a modification of ordinary cross decomposition that eliminates the need for using the Benders or Dantzig-Wolfe master problem. It is a generalization of the Brown-Robinson method for a finite matrix game and can also be considered as a generalization of the Kornai-Liptak method. It is based on the subproblem phase in cross decomposition, where we iterate between the dual subproblem and the primal subproblem. As input to the dual subproblem we use the average of a part of all dual solutions of the primal subproblem, and as input to the primal subproblem we use the average of a part of all primal solutions of the dual subproblem. In this paper we give a new proof of convergence for this procedure. Previously convergence has only been shown for the application to a special separable case (which covers the Kornai-Liptak method), by showing equivalence to the Brown-Robinson method.  相似文献   

18.
In this paper, we propose a trust region method for unconstrained optimization that can be regarded as a combination of conic model, nonmonotone and line search techniques. Unlike in traditional trust region methods, the subproblem of our algorithm is the conic minimization subproblem; moreover, our algorithm performs a nonmonotone line search to find the next iteration point when a trial step is not accepted, instead of resolving the subproblem. The global and superlinear convergence results for the algorithm are established under reasonable assumptions. Numerical results show that the new method is efficient for unconstrained optimization problems.  相似文献   

19.
An adaptive trust region method and its convergence   总被引:17,自引:0,他引:17  
In this paper, a new trust region subproblem is proposed. The trust radius in the new subproblem adjusts itself adaptively. As a result, an adaptive trust region method is constructed based on the new trust region subproblem. The local and global convergence results of the adaptive trust region method are proved. Numerical results indicate that the new method is very efficient.  相似文献   

20.
一类单调变分不等式的非精确交替方向法   总被引:1,自引:0,他引:1       下载免费PDF全文
交替方向法适合于求解大规模问题.该文对于一类变分不等式提出了一种新的交替方向法.在每步迭代计算中,新方法提出了易于计算的子问题,该子问题由强单调的线性变分不等式和良态的非线性方程系统构成.基于子问题的精确求解,该文证明了算法的收敛性.进一步,又提出了一类非精确交替方向法,每步迭代计算只需非精确求解子问题.在一定的非精确条件下,算法的收敛性得以证明.  相似文献   

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

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