Linear and strong convergence of algorithms involving averaged nonexpansive operators

We introduce regularity notions for averaged nonexpansive operators. Combined with regularity notions of their fixed point sets, we obtain linear and strong convergence results for quasicyclic, cyclic, and random iterations. New convergence results on the Borwein–Tam method (BTM) and on the cyclically anchored Douglas–Rachford algorithm (CADRA) are also presented. Finally, we provide a numerical comparison of BTM, CADRA and the classical method of cyclic projections for solving convex feasibility problems.     

Viscosity Approximation Methods for a Class of Generalized Split Feasibility Problems with Variational Inequalities in Hilbert Space

Strong convergence theorem of viscosity approximation methods for nonexpansive mapping have been studied. We also know that CQ algorithm for solving the split feasibility problem (SFP) has a weak convergence result. In this paper, we use viscosity approximation methods and some related knowledge to solve a class of generalized SFP’s with monotone variational inequalities in Hilbert space. We propose some iterative algorithms based on viscosity approximation methods and get strong convergence theorems. As applications, we can use algorithms we proposed for solving split variational inequality problems (SVIP), split constrained convex minimization problems and some related problems in Hilbert space.     

Feasibility study for the measurement of Bc meson mass and lifetime with the general purpose detector at the LHC

In this paper a feasibility study of the Bc meson to measure its mass and lifetime is described with the general purpose detector at the LHC.The study solely concentrated on the J/Ψπ+,J/Ψ→μ+μ- decay channel of the Bc and it was concluded that about 120 events can be selected in the first fb-1 of data.With this data sample,the mass resolution was estimated to be 2.0(stat.) MeV/c2 while the cr resolution was found to be 13.1(stat.) μm,I.e.the lifetime resolution to be 0.044(stat.) ps.     

基于FCE的建设项目环境效益可研指标的应用——以高速公路建设项目为例

应用FCE进行建设项目环境效益可研指标体系综合评价是一条科学精简的途径.高速公路建设项目对项目沿线环境的影响典型而尖锐,以高速公路建设项目为例分析FCE在建设项目环境效益可研指标中的应用,并以福银高速公路一期工程尤溪段施工期环境效益可研为例建立应用模型.     

Feasibility of home-away-pattern sets for round robin tournaments

A Home-Away-Pattern (HAP) set defines each team’s venue in each period. We consider the decision problem of whether a round robin tournament can be arranged on the basis of a given HAP set. We give a necessary condition which can be checked in polynomial time and conjecture it to be sufficient.     

Some Remarks on the Convex Feasibility Problem and Best Approximation Problem

In this paper we investigate several solution algorithms for the convex fea- sibility problem(CFP)and the best approximation problem(BAP)respectively.The algorithms analyzed are already known before,but by adequately reformulating the CFP or the BAP we naturally deduce the general projection method for the CFP from well-known steepest decent method for unconstrained optimization and we also give a natural strategy of updating weight parameters.In the linear case we show the connec- tion of the two projection algorithms for the CFP and the BAP respectively.In addition, we establish the convergence of a method for the BAP under milder assumptions in the linear case.We also show by examples a Bauschke's conjecture is only partially correct.     

A new iterative method for solving split feasibility problem

In this paper, we construct a new iterative algorithm and show that the newly introduced iterative algorithm converges faster than a number of existing iterative algorithms for contractive-like mappings. We present a numerical example followed by graphs to validate our claim. We prove strong and weak convergence results for approximating fixed points of generalized $\alpha$-nonexpansive mappings. Again we reconfirm our results by an example and table. Further, we utilize our proposed algorithm to solve split feasibility problem.     

Analytic Center Cutting-Plane Method with Deep Cuts for Semidefinite Feasibility Problems

An analytic center cutting-plane method with deep cuts for semidefinite feasibility problems is presented. Our objective in these problems is to find a point in a nonempty bounded convex set in the cone of symmetric positive-semidefinite matrices. The cutting plane method achieves this by the following iterative scheme. At each iteration, a query point that is an approximate analytic center of the current working set is chosen. We assume that there exists an oracle which either confirms that or returns a cut A S ^m {YS ^m : AY AY - } , where 0. If , an approximate analytic center of the new working set, defined by adding the new cut to the preceding working set, is then computed via a primal Newton procedure. Assuming that contains a ball with radius > 0, the algorithm obtains eventually a point in , with a worst-case complexity of O ^*(m ³/²) on the total number of cuts generated.     

Experimental study on SC RF cavities by using China large grain niobium for ILC

Large grain niobium has the potential of simplifying the production sequence and consequently reducing the cost of the superconducting RF cavities for ILC.To investigate the feasibility of fabrication and the possibility to achieve high gradient by large grain cavities,two 1.3 GHz cavities were made of China large grain niobium and a series of vertical tests were carried out following several different surfaces treatment procedures.Two cavities have both reached the high gradient of more than 43 MV/m repeatedly and the maximum accelerating field of 47.9 MV/m has been achieved by China large grain niobium.This paper introduces the features of the fabrication and surface treatments on the large grain cavities and presents the preliminary results of the research.     

Measurement of spatial object''''s exterior attitude based on linear CCD

It is difficult to realize real-time measurement of exterior attitude by the traditional systems based on the area image sensor which have conflict between speed and accuracy.The subsystem for three-dimensional (3D) coordinate rcconstruction of point target (S3DCRPT) which is composed of three one-dimensional (1D) cameras based on linear charge-coupled device (CCD) can determine the distant light spots' spatial position. The attitude angle of the measured object is determined by the spatial solution while the coordinate reconstruction is separately carried on by the S3DCRPT with some point cooperation targets (PCTs) on the measured object. A new optical system is designed to solve the interference problem with one-to-one relationship between the PCTs and the S3DCRPT optical subsystems,which improves the measurement accuracy and saves space. The mathematical model of the attitude measurement is established,and partial and global calibrations are realized for the multi-camera attitude measurement system.The test results show the feasibility of the exterior attitude measurement based on linear CCD.