In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.

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.

‎in this paper‎, ‎we propose a feasible interior-point method for‎ ‎convex quadratic programming over symmetric cones‎. ‎the proposed algorithm relaxes the‎ ‎accuracy requirements in the solution of the newton equation system‎, ‎by using an inexact newton direction‎. ‎furthermore‎, ‎we obtain an‎ ‎acceptable level of error in the inexact algorithm on convex‎ ‎quadratic symmetric cone programmin...

Global convergent hybrid method is presented for computing the minimum distance between a point and a plane parametric curve. First, it uses a first order geometric iteration method. If iterative parametric value satisfied local Newton convergence condition and convergence in appropriate area, then turning to Newton iteration method. This hybrid method’s sensitivity to the choice of initial val...

Inexact Newton regularization methods have been proposed by Hanke and Rieder for solving nonlinear ill-posed inverse problems. Every such a method consists of two components: an outer Newton iteration and an inner scheme providing increments by regularizing local linearized equations. The method is terminated by a discrepancy principle. In this paper we consider the inexact Newton regularizatio...

In this article we present robust, efficient and accurate fully implicit time-stepping schemes and nonlinear solvers for systems of reaction-diffusion equations. The applications of reaction-diffusion systems is abundant in the literature, from modelling pattern formation in developmental biology to cancer research, wound healing, tissue and bone regeneration and cell motility. Therefore, it is...

We show how the method of pseudo-transient continuation can be applied to improve the robustness of the Newton iteration within a nonlinear transient elasticity simulation. Pseudotransient continuation improves efficiency and robustness of the transient analysis by enabling larger time steps than possible with a Newton iteration. We illustrate the algorithm by reporting on a simulation of a buc...

Robust linear and nonlinear control is a continuing requirement for automotive powertrain controls. Newton iteration techniques have been proposed for both nonparametric linear and recently nonlinear control. Such nonparametric methods may eventually allow benefits of both low-order controllers and more rapid calibration time. This paper evaluates the feasibility of such Newton iteration techni...

The Newton iteration is a popular method for minimising a cost function on Euclidean space. Various generalisations to cost functions defined on manifolds appear in the literature. In each case, the convergence rate of the generalised Newton iteration needed establishing from first principles. The present paper presents a framework for generalising iterative methods from Euclidean space to mani...

for the nonlinear analysis of structures using the well known newton-raphson method, the tangent stiffness matrices of the elements must be constructed in each iteration. due to the high expense required to find the exact tangent stiffness matrices, researchers have developed novel innovations into the newton-raphson method to reduce the cost and time required by the analysis. in this paper, a ...