in this paper, we present a full newton step feasible interior-pointmethod for circular cone optimization by using euclidean jordanalgebra. the search direction is based on the nesterov-todd scalingscheme, and only full-newton step is used at each iteration.furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.

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...

in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.

This paper presents a comparison between variational iteration method (VIM) and modfied variational iteration method (MVIM) for approximate solution a system of Volterra integral equation of the first kind. We convert a system of Volterra integral equations to a system of Volterra integro-di®erential equations that use VIM and MVIM to approximate solution of this system and hence obtain an appr...

Iteration method is commonly used in solving linear systems of equations. We present quantum algorithms for the relaxed row and column iteration methods by constructing unitary matrices iterative processes, which generalize to solve on a computer. Comparing with conventional methods, convergence accelerates when appropriate parameters are chosen. Once states efficiently prepared, complexity our...