Search

The main goal of this paper is to study the order of convergence and the efficiency of four families of iterative methods using frozen divided differences. The first two families correspond to a generalization of the secant method and the implementation made by Schmidt and Schwetlick. The other two frozen schemes consist of a generalization of Kurchatov method and an improvement of this method applying the technique used by Schmidt and Schwetlick previously. An approximation of the local convergence order is generated by the examples, and it numerically confirms that the order of the methods is well deduced. Moreover, the computational efficiency indexes of the four algorithms are presented and computed in order to compare their efficiency. [ABSTRACT FROM AUTHOR]

In this paper, we use the auxiliary principle technique to suggest and analyze an implicit iterative method for solving bifunction variational inequalities. We also study the convergence criteria of this new method under pseudomonotonicity condition. [ABSTRACT FROM AUTHOR]

Many optimization problems reduce to the solution of a system of linear inequalities (SLI). Some solution methods use relaxed, averaged projections. Others invoke surrogate constraints (typically stemming from aggregation). This paper proposes a blend of these two approaches. A novelty comes from introducing as surrogate constraint a halfspace defined by differences of algorithmic iterates. The first iteration is identical to surrogate constraints methods. In next iterations, for a given approximation x¯, besides the violated constraints in x¯, we also take into consideration the surrogate inequality, which we have obtained in the previous iteration. The motivation for this research comes from the recent work of Scolnik et al. (Appl. Numer. Math. 41, 499—513, 2002), who studied some projection methods for a system of linear equations. [ABSTRACT FROM AUTHOR]