A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis

In this note we propose an iterative scheduling technique which consists of consecutive forward/backward scheduling passes aimed at reducing the project duration by smoothing out the project's resource profile. The idea of iterative scheduling is initiated by Li and Willis in their related paper. The only common point between their scheduling technique and the one proposed here is the iterative feature. The two techniques differ both in algorithmic aspects and in the way activities are selected for scheduling at a decision point. In the technique proposed here activities are evaluated by well-reputed dispatching rules and a conflict based decision-making process called Local Constraint Based Analysis (LCBA). The results on benchmark problems from the literature demonstrate that LCBA specifically exploits the flexible activity time windows provided by the iterative scheduling technique.     

SUCCESSIVELY ITERATIVE TECHNIQUE OF SIGN-CHANGING SOLUTION TO A NONLINEAR THIRD-ORDER BOUNDARY VALUE PROBLEM

The iterative technique of sign-changing solution is studied for a nonlinear third-order two-point boundary value problem, where the nonlinear term has the time sin-gularity. By applying the monotonically iterative technique, an existence theorem is established and two useful iterative schemes are obtained.     

一类非线性二阶三点边值问题的单调迭代方法

1 引言 本文的目的是对于下列非线性二阶常微分方程的三点边值问题建立正解迭代格式 (P)w~(11)(t)+f(t,w(t))=0,0≤t≤1,w(0)=0,aw(η)=w (1)其中0<η<1,0<α<1/η。这里问题(P)的正解w~*是指满足w~*(t)>0,0相似文献   

广义集值强非线性混合似变分不等式的辅助原理和三步迭代算法

使用辅助原理技巧研究了一类广义集值强非线性混合变分不等式．证明了此类集值强非线性混合变分不等式辅助问题解的存在性和唯一性;构建了一个新的三步迭代算法,通过辅助原理技巧,构建并计算此类非线性混合变分不等式的近似解,进一步证明非线性混合变分不等式解的存在性以及由算法产生的三个序列的收敛性．所得结论推广了近年来许多混合变分不等式和准变分不等式以及他们的有关结果．     

线性定常广义系统的D型迭代学习控制收敛性

给出了线性定常广义系统在D型学习律作用下的迭代控制收敛性结果,这一结果是全新的,其对时变系统也成立,而且,本文结果和方法大部分可以移植到线性定常广义离散时间系统.     

Iterative and non-iterative methods for non-linear Volterra integro-differential equations

Iterative and non-iterative methods for the solution of nonlinear Volterra integro-differential equations are presented and their local convergence is proved. The iterative methods provide a sequence solution and make use of fixed-point theory, whereas the non-iterative ones result in series solutions and also make use of fixed-point principles. By means of integration by parts and use of certain integral identities, it is shown that the initial conditions that appear in the iterative methods presented here can be eliminated and the resulting iterative technique is identical to the variational iteration method which is derived here without making any use at all of Lagrange multipliers and constrained variations. It is also shown that the formulation presented here can be applied to initial-value problems in ordinary differential, Volterra’s integral and integro-differential, pantograph, and nonlinear and linear algebraic equations. A technique for improving/accelerating the convergence of the iterative methods presented here is also presented and results in a Lipschitz constant that may be varied as the iteration progresses. It is shown that this acceleration technique is related to preconditioning methods for the solution of linear algebraic equations. It is also argued that the non-iterative methods presented in this paper may not competitive with iterative ones because of possible cancellation errors, if implemented numerically. An analytical continuation procedure based on dividing the interval of integration into disjoint subintervals is also presented and its limitations are discussed.     

Bifunction hemivariational inequalities

In this paper, we introduce and consider a new class of variational inequalities, which is called the bifunction hemivariational inequality. This new class includes several classes of variational inequalities as special cases. A number of iterative methods for solving bifunction hemivariational inequalities are suggested and analyzed by using the auxiliary principle technique. We also study the convergence analysis of these iterative methods under some mild conditions. The results obtained in this paper can be considered as a novel application of the auxiliary principle technique.     

Order Interval Test and Iterative Method for Nonlinear Systems

An order interval test for existence and uniqueness of solutions to a nonlinear system is given. It combines the interval technique and the monotone iterative technique. It has the main merits of interval iterative methods but need not use interval arithmetic. An order interval Newton method is also given, which is globally convergent. It is a generalization of the results in [3,4,13.3].     

Convergence of skew-symmetric iterative methods

We propose a new technique for studying the convergence of triangular skew-symmetric and product triangular skew-symmetric iterative methods (introduced earlier by the first author) based on the notion of a field of values of a matrix. We obtain formulas connecting the field of values of the initial matrix, that of the matrix which determines the iterative method, and eigenvalues of the iterative matrix. We prove that the mentioned methods can converge even if the initial matrix is not dissipative.     

Banach空间一阶脉冲微分方程的初值问题

利用单调迭代方法,在Ｂａｎａｃｈ空间研究了更为一般脉冲微分方程的初值问题的最小最大拟解的存在性及迭代逼近程序。     

2n阶Lidstone边值问题正解的逐次迭代

研究了2n阶Lidstone边值问题正解的逐次迭代,其中非线性项依赖于所有偶数阶导数.通过考察非线性项在某些有国介集合上的“高度”并利用单调迭代方法构造了一个逐次迭代程序.这个迭代程序从一个多项式开始并且是可行的.使用这个结论获得了m个正解的迭代方法,其中m是一个任意的自然数.     

一类二阶两点边值问题的单调迭代方法

通过改进经典的单调迭代方法对于一类二阶两点边值的问题的正解建立了单调迭代程序。这些迭代程序都是从常值函数开始的，因而是可行并且有效的。     

Monotone iteration method for differential equations involving integral boundary conditions on the half line

By applying the monotone iterative methods, we obtain the existence of monotone positive solutions for integral boundary value problems of differential equations on the half line, and establish the iterative schemes for approximating the solutions. Our approach is based on the fixed point theorem and the monotone iterative technique. The existence of lower and upper solutions is not needed.     

关于fuzzy映射的完全广义混合强非线性变分包含

引入并研究了Hilbert空间中一类新的关于fuzzy映射的完全广义混合强非线性变分包含，利用极大单调映射的预解算子技巧构造迭代算法．并证明此变分包含的解的存在性及由迭代算法所生成的迭代序列的收敛性。所得结果改进并推广以往所得的相应结果。     

带变号系数的经典Gelfand模型的正解

考察了经典Gelfand模型的正解的存在与迭代,其中非线性项的系数允许在[0,1]中改变符号。利用单调迭代方法得到了一个正解存在定理,给出了相应的迭代程序和收敛速度。由于这个迭代程序是从零函数开始的,因此它是简单、可行并且有效的。     

Variational iteration technique for solving nonlinear equations

In this paper, we use the variational iteration technique to suggest some new iterative methods for solving nonlinear equations f(x)=0. We also discuss the convergence criteria of these new iterative methods. Comparison with other similar methods is also given. These new methods can be considered as an alternative to the Newton method. We also give several examples to illustrate the efficiency of these methods. This technique can be used to suggest a wide class of new iterative methods for solving system of nonlinear equations.     

An iterative method for solving the strong vector equilibrium problem with variable domination structure

In this paper, an iterative algorithm for solving the strong vector equilibrium problem with variable domination structure (VSVEP) is considered. First, an auxiliary problem for the VSVEP is introduced and the relationships between the auxiliary problem and VSVEP are discussed. Then, using the auxiliary principle technique, a projection iterative algorithm to compute the approximate solutions of the VSVEP is proposed and analysed. Furthermore, convergence of the iterative sequences generated by this algorithm is investigated under suitable conditions of continuity and convexity. These results extend and improve some recent works in this field.     

线性方程组迭代方法残差光滑技术的一个推广

1　引　　言我们考虑求解线性方程组Ax=b,A∈Rn×n,b,x∈Rn.(1)的迭代方法.迭代序列{xk}的性态常常由与之对应的残差范数序列{‖rk‖}的特性来决定.人们自然希望{‖rk‖}光滑地(单调地)收敛到0.在所有Krylov子空间方法中,GMRES[7]方法因为可使{‖rk‖}最优地趋于0,故是一个较为成功的方法.但是,GMRES方法的工作量和存贮量却随着迭代步数的增加而迅速增加.而BCG[4]和CGS[10]等方法具有运算量小,收敛快等突出优点.但它们的残差范数性态却很不规则,{‖rk‖}振荡不定.这给判断收敛性及何时停机带来很大的不便.残差光滑技术是一个行之有…     

Jacobi-Picard iteration method for the numerical solution of nonlinear initial value problems

In this paper, an effective numerical iterative method for solving nonlinear initial value problems (IVPs) is presented. The proposed iterative scheme, called the Jacobi-Picard iteration (JPI) method, is based on the Picard iteration technique, orthogonal shifted Jacobi polynomials, and shifted Jacobi-Gauss quadrature formula. In comparison with traditional methods, the JPI method uses an iterative formula for updating next step approximations and calculating integrals of the shifted Jacobi polynomials are performed via an exact relation. Also, a vector-matrix form of the JPI method is provided in details which reduce the CPU time. The performance of the presented method has been investigated by solving several nonlinear IVPs. Numerical results show the efficiency and the accuracy of the proposed iterative method.     

Auxiliary Principle and Algorithm for Mixed Equilibrium Problems and Bilevel Mixed Equilibrium Problems in Banach Spaces

A new class of bilevel mixed equilibrium problems is introduced and studied in real Banach spaces. By using the auxiliary principle technique, new iterative algorithms for solving the mixed equilibrium problems and bilevel mixed equilibrium problems are suggested and analyzed. Strong convergence of the iterative sequences generated by the algorithms is proved under suitable conditions. The behavior of the solution set of the bilevel mixed equilibrium problem is also discussed.