Previous work showed that total variation superiorization (TVS) improves reconstructed image quality in proton computed tomography (pCT). The structure of the TVS algorithm has evolved since then and this work investigated if this new algorithmic structure provides additional benefits to pCT image quality. Structural and parametric changes introduced to the original TVS algorithm included: (1) ...

In this paper, first a new homotopy perturbation method for solving a fractional order nonlinear telegraph equation is introduced. By applying the proposed method, the nonlinear equation is translated to linear equations for per iteration of homotopy perturbation method. Then, the obtained problems are solved with separation method. In the examples, it is illustrated that the exact solution is ...

in this paper, we consider the variational homotopy perturbation method (vhpm) to obtain an approximate series solution for the generalized fisher’s equation which converges to the exact solution in the region of convergence. comparisons are made among the variational iteration method (vim), the exact solutions and the proposed method. the results reveal that the proposed method is very effectiv...

we present an improved version of a full nesterov-todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (bull. iranian math. soc.,40(3), 541-564, (2014)). in the earlier version, each iteration consistedof one so-called feasibility step and a few -at most three -centering steps. here, each iteration consists of only a feasibilitystep. thus, the new alg...

The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...

In this paper we generalize an infeasible interior-point method for linear optimization to horizontal linear complementarity problem (HLCP). This algorithm starts from strictly feasible iterates on the central path of a perturbed problem that is produced by suitable perturbation in HLCP problem. Then, we use so-called feasibility steps that serves to generate strictly feasible iterates for the ...

An application of simultaneous perturbation stochastic approximation (SPSA) algorithm with two measurements per iteration to the problem of object tracking on video is discussed. The upper bound of mean square estimation error is determined in case of once differentiable functional and almost arbitrary noises. Weak restrictions on uncertainty allow to use random sampling instead of full pixelwi...

In this paper, we will compare a Homotopy perturbation algorithm and Taylor series expansin method for a system of second kind Fredholm integral equations. An application of He’s homotopy perturbation method is applied to solve the system of Fredholm integral equations. Taylor series expansin method reduce the system of integral equations to a linear system of ordinary differential equation.

In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...

As an indicator of the stability spectral clustering undirected weighted graph into k clusters, th gap Laplacian is often considered. The characterized in this paper as unstructured distance to ambiguity, namely minimal arbitrary symmetric matrices with vanishing gap. a conceptually more appropriate measure stability, structured ambiguity -clustering introduced Laplacians graphs same vertices a...