In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasibl...

In this paper, we propose a feasible primal-dual path-following algorithm for convex quadratic programs.At each interior-point iteration the algorithm uses a full-Newton step and a suitable proximity measure for tracing approximately the central path.We show that the short-step algorithm has the best known iteration bound,namely O( √ n log (n+1) ).

In this paper a truncated turbo decoding with reduced computational complexity is proposed. In the course of iterative decoding, bits are detected that will be changed very unlikely in the current iteration step. These bits are excluded from decoding (in the current iteration step) which yields a turbo decoding with much lower complexity while the loss of bit error rate (BER) is quiet small.

Abstract The objective of this article is to study a three-step iteration process in the framework Banach spaces and obtain convergence results for Suzuki generalized nonexpansive mappings. We also provide numerical examples that support our main illustrate behavior proposed process. Further, we present data-dependence result supported by nontrivial example. Finally, discuss solution nonlinear ...

Abstract In this paper, we propose two hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem. Based on algorithm, firstly add term into iteration to accelerate convergence of and adopt flexible rules selecting stepsize shrinking region, which makes an optimal available at each iteration. The region is intersection three sets, are set C hyperplanes. ...

This papers aims at providing a combined strategy for solving systems of equalities and inequalities. The combined strategy uses two types of steps: a global search step and a local search step. The global step relies on a tabu search heuristic and the local step uses a deterministic search known as Hooke and Jeeves. The choice of step, at each iteration, is based on the level of reduction of t...

The development of large computational resources leads to search for parallel implementation not only based on space decomposition. In this talk we will propose to combine time domain decomposition and the simple deferred correction. The deferred correction [1, 2] builds a perturbated problemwhich the exact solution is known. The defect difference between the perturbated solution and the soluti...

The objective of this paper is to produce a general formulation of an order reduction procedure for testing the stability of discrete time linear systems. The order reduction procedure involves a series of iterations and, at each step of the iteration process, the aim is to derive a new polynomial of order lower than the given one. The new polynomial serves as the input to the following iterati...

In this paper, we introduce an iteration process for approximating common fixed points of two nonself asymptotically nonexpansive mappings in Banach spaces. Our process contains Mann iteration process and some other processes for nonself mappings but is independent of Ishikawa iteration process. We prove some weak and strong convergence theorems for this iteration process. Our results generaliz...

In this paper, a relatively new method, namely variational iteration method (VIM), is developed for free vibration analysis of a Timoshenko beam with different boundary conditions. In the VIM, an appropriate Lagrange multiplier is first chosen according to order of the governing differential equation of the boundary value problem, and then an iteration process is used till the desired accuracy ...