On global convergence rate of two acceleration projection algorithms for solving the multiple-sets split feasibility problem

In this paper, we introduce two fast projection algorithms for solving the multiple-sets split feasibility problem (MSFP). Our algorithms accelerate algorithms proposed in [8] and are proved to have a global convergence rate O(1=n2). Preliminary numerical experiments show that these algorithms are practical and promising.

Convergence rate of some hybrid multigrid methods for variational inequalities

In [L. Badea, Global convergence rate of a standard multigrid method for variational inequalities, IMA J. Numer. Anal., 34 (2014), No. 1, 197-216], a global convergence rate of the standard monotone multigrid method for variational inequalities is derived. This algorithm can be also viewed as performing multiplicative iterations on each level and also multiplicative iterations over the levels. In the present paper, this algorithm together with other three algorithms,which are combinations of additive or multiplicative iterations on levels with additive or multiplicative iterations over the levels, are analyzed in a unitary manner and in a more general framework which allow us to consider problems in the Sobolev space W

Hybrid Evolution Strategies Algorithm Based on Dynamic Demes

A hybrid evolution strategies algorithm based on dynamic demes is proposed in this paper. Evolutionary strategy algorithm is likely premature, and even simulated annealing with the character of local search is impossible to escape this range, when change the population based on the maximum entropy principle so that the individual out of this range, which can quickly converge to the global optimum. The numerical computation results indicate that the algorithm can gain higher global convergence rate and higher speed