25 Langridge, J. I., Evans, A. M., Ghosh, D., Walton, T. J., Brenton, A. G., Harris, F. M. and Newton, R. P. (1991) Anal. Chim. Acta 247, 177-185 26 Langridge, J. I. , Brenton, A. G., Walton, T. J., Harris, F. M. and Newton, R. P. (1993) Rapid Commun. Mass Spectrom. 7,293-303 27 Newton, R. P., Walton, T. J., Brenton, A. G., Kingston, E. E. and Harris, F. M. (1989) Rapid Commun. Mass Spectrom. 3...

In this paper, we precise the asymptotic behaviour of Newton polygons of L-functions associated to character sums, coming from certain n variable Laurent polynomials. In order to do this, we use the free sum on convex polytopes. This operation allows the determination of the limit of generic Newton polygons for the sum ∆ = ∆1 ⊕ ∆2 when we know the limit of generic Newton polygons for each facto...

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

We present an Altered Jacobian Newton Iterative Method for solving nonlinear elliptic problems. Effectiveness of the proposed method is demonstrated through numerical experiments. Comparison of our method with Newton Iterative Method is also presented. Convergence of the Newton Iterative Method is highly sensitive to the initialization or initial guess. Reported numerical work shows the robustn...

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.

Quasi-Newton methods have played a prominent role, over many years, in the design of effective practical methods for the numerical solution of nonlinear minimization problems and in multi-dimensional zero-finding. There is a wide literature outlining the properties of these methods and illustrating their performance [e.g., [8]]. In addition, most modern optimization libraries house a quasi-Newt...

In this paper, we investigate the convergence behaviour of a class of regularized Newton methods for the solution of nonlinear inverse problems. In order to keep the overall numerical effort as small as possible, we propose to solve the linearized equations by certain semiiterative regularization methods, in particular, iterations with optimal speed of convergence. Our convergence rate analysis...

The paper deals with three different Newton algorithms that have recently been worked out in the general frame of affine invariance. Of particular interest is their performance in the numerical solution of discretized boundary value problems (BVPs) for nonlinear partial differential equations (PDEs). Exact Newton methods, where the arising linear systems are solved by direct elimination, and in...