Partitioned quasi-Newton methods for nonlinear equality constrained optimization

We derive new quasi-Newton updates for the (nonlinear) equality constrained minimization problem. The new updates satisfy a quasi-Newton equation, maintain positive definiteness on the null space of the active constraint matrix, and satisfy a minimum change condition. The application of the updates is not restricted to a small neighbourhood of the solution. In addition to derivation and motivational remarks, we discuss various numerical subtleties and provide results of numerical experiments.Research partially supported by the Applied Mathematical Sciences Research Program (KC-04-02) of the Office of Energy Research of the US Department of Energy under grant DE-FG02-86ER25013.A000, and by the US Army Research Office through the Mathematical Sciences Institute, Cornell University.     

Solving nonlinear integral equations of Fredholm type with high order iterative methods

The application of high order iterative methods for solving nonlinear integral equations is not usual in mathematics. But, in this paper, we show that high order iterative methods can be used to solve a special case of nonlinear integral equations of Fredholm type and second kind. In particular, those that have the property of the second derivative of the corresponding operator have associated with them a vector of diagonal matrices once a process of discretization has been done.     

A unified approach for constructing fast two-step Newton-like methods

We introduce some new very general ways of constructing fast two-step Newton-like methods to approximate a locally unique solution of a nonlinear operator equation in a Banach space setting. We provide existence-uniqueness theorems as well as an error analysis for the iterations involved using Newton-Kantorovich-type hypotheses and the majorant method. Our results depend on the existence of a Lipschitz function defined on a closed ball centered at a certain point and of a fixed radius and with values into the positive real axis. Special choices of this function lead to favorable comparisons with results already in the literature. Some applications to the solution of nonlinear integral equations appearing in radiative transfer as well as to the solution of integral equations of Uryson-type are also provided.     

A quasi-Newton method for solving fixed point problems in Hilbert spaces

Summary We study the convergence properties of a projective variant of Newton's method for the approximation of fixed points of completely continuous operators in Hilbert spaces. We then discuss applications to nonlinear integral equations and we produce some numerical examples.     

Mathematical foundations of nonsmooth embedding methods

This paper establishes a mathematical foundation for application of the well known classical embedding approach to a class of nonsmooth functions, using a recently developed analogue of the derivative in cases where the functions involved fail to be differentiable in the usual sense. As part of this development we show how to obtain an extension to this case of the classical Hadamard theorem giving conditions for a map of ⁿ to itself to be a homeomorphism.The research reported here was sponsored by the National Science Foundation under Grant CCR-8801489, and by the Air Force Systems Command, USAF, under Grants AFOSR-88-0090 and AFOSR-89-0058. The US Government has certain rights in this material, and is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.     

Kantorovich-type semilocal convergence analysis for inexact Newton methods

We provide a new semilocal convergence analysis for generating an inexact Newton method converging to a solution of a nonlinear equation in a Banach space setting. Our analysis is based on our idea of recurrent functions. Our results are compared favorably to earlier ones by others and us (Argyros (2007, 2009) [5] and [6], Argyros and Hilout (2009) [7], Guo (2007) [15], Shen and Li (2008) [18], Li and Shen (2008) [19], Shen and Li (2009) [20]). Numerical examples are provided to show that our results apply, but not earlier ones [15], [18], [19] and [20].     

On the quadrature error in operational quadrature methods for convolutions

Summary We analyze the quadrature error associated with operational quadrature methods for convolution equations. The assumptions are that the convolution kernel is inL ¹ and that its Laplace transform is analytic and bounded in an obtuse sector of the complex plane. Under these circumstances the Laplace transform has a slow variation property which admits a Fourier analysis of the quadrature error. We provide generalL ^p error estimates assuming suitable smoothness conditions on the function under convolution.     

A new smoothing quasi-Newton method for nonlinear complementarity problems

A new smoothing quasi-Newton method for nonlinear complementarity problems is presented. The method is a generalization of Thomas’ method for smooth nonlinear systems and has similar properties as Broyden's method. Local convergence is analyzed for a strictly complementary solution as well as for a degenerate solution. Presented numerical results demonstrate quite similar behavior of Thomas’ and Broyden's methods.     

Monotonieeigenschaften des Steffensen-Verfahrens

Steffensen's method is slightly generalized by introducing a real parameter. In this way one can get different monotonicity properties, depending on the choice of this parameter. These monotonicity statements give the possibility of bracketing the solution of a given problem. In a special case they even ensure the convergence and the existence of a solution. Furthermore there are given sufficient conditions, which show that Steffensen's method converges at least as quickly as Newton's method. A numerical example shows the efficiency of the theorems and compares Steffensen's and Newton's method.

     

High performance parallel numerical methods for Volterra equations with weakly singular kernels

Non-stationary discrete time waveform relaxation methods for Abel systems of Volterra integral equations using fractional linear multistep formulae are introduced. Fully parallel discrete waveform relaxation methods having an optimal convergence rate are constructed. A significant expression of the error is proved, which allows us to estimate the number of iterations needed to satisfy a prescribed tolerance and allows us to identify the problems where the optimal methods offer the best performance. The numerical experiments confirm the theoretical expectations.     

Solution of a nonsymmetric algebraic Riccati equation from a two-dimensional transport model

For the steady-state solution of an integral-differential equation from a two-dimensional model in transport theory, we shall derive and study a nonsymmetric algebraic Riccati equation B^--XF^--F⁺X+XB⁺X=0, where , and with a nonnegative matrix P, positive diagonal matrices D^±, and nonnegative parameters f, and . We prove the existence of the minimal nonnegative solution X^∗ under the physically reasonable assumption , and study its numerical computation by fixed-point iteration, Newton’s method and doubling. We shall also study several special cases; e.g. when and P is low-ranked, then is low-ranked and can be computed using more efficient iterative processes in U and V. Numerical examples will be given to illustrate our theoretical results.     

On the semilocal convergence of inexact Newton methods in Banach spaces

We provide two types of semilocal convergence theorems for approximating a solution of an equation in a Banach space setting using an inexact Newton method [I.K. Argyros, Relation between forcing sequences and inexact Newton iterates in Banach spaces, Computing 63 (2) (1999) 134–144; I.K. Argyros, A new convergence theorem for the inexact Newton method based on assumptions involving the second Fréchet-derivative, Comput. Appl. Math. 37 (7) (1999) 109–115; I.K. Argyros, Forcing sequences and inexact Newton iterates in Banach space, Appl. Math. Lett. 13 (1) (2000) 77–80; I.K. Argyros, Local convergence of inexact Newton-like iterative methods and applications, Comput. Math. Appl. 39 (2000) 69–75; I.K. Argyros, Computational Theory of Iterative Methods, in: C.K. Chui, L. Wuytack (Eds.), in: Studies in Computational Mathematics, vol. 15, Elsevier Publ. Co., New York, USA, 2007; X. Guo, On semilocal convergence of inexact Newton methods, J. Comput. Math. 25 (2) (2007) 231–242]. By using more precise majorizing sequences than before [X. Guo, On semilocal convergence of inexact Newton methods, J. Comput. Math. 25 (2) (2007) 231–242; Z.D. Huang, On the convergence of inexact Newton method, J. Zheijiang University, Nat. Sci. Ed. 30 (4) (2003) 393–396; L.V. Kantorovich, G.P. Akilov, Functional Analysis, Pergamon Press, Oxford, 1982; X.H. Wang, Convergence on the iteration of Halley family in weak condition, Chinese Sci. Bull. 42 (7) (1997) 552–555; T.J. Ypma, Local convergence of inexact Newton methods, SIAM J. Numer. Anal. 21 (3) (1984) 583–590], we provide (under the same computational cost) under the same or weaker hypotheses: finer error bounds on the distances involved; an at least as precise information on the location of the solution. Moreover if the splitting method is used, we show that a smaller number of inner/outer iterations can be obtained.     

Approximate solutions of some Mellin equations with conjugation

We prove some stability results for a simple numerical method for Mellin convolution operators with conjugation and investigate the Fredholm property for its local operators.     

On the local convergence of inexact Newton-type methods under residual control-type conditions

A local convergence analysis of inexact Newton-type methods using a new type of residual control was recently presented by C. Li and W. Shen. Here, we introduce the center-Hölder condition on the operator involved, and use it in combination with the Hölder condition to provide a new local convergence analysis with the following advantages: larger radius of convergence, and tighter error bounds on the distances involved. These results are obtained under the same hypotheses and computational cost. Numerical examples further validating the theoretical results are also provided in this study.     

Majorizing sequences for Newton’s method from initial value problems

The most restrictive condition used by Kantorovich for proving the semilocal convergence of Newton’s method in Banach spaces is relaxed in this paper, providing we can guarantee the semilocal convergence in situations that Kantorovich cannot. To achieve this, we use Kantorovich’s technique based on majorizing sequences, but our majorizing sequences are obtained differently, by solving initial value problems.     

The Ulm method under mild differentiability conditions

The Ulm method is considered to approximate a solution of a nonlinear operator equation F(x) = 0. We study the convergence of this method when F′ is ω-conditioned and prove that the R-order of convergence is at least 1 + p if ω is quasi-homogeneous of type ω(tz)≤ t ^p ω(z), for z > 0, tϵ[0,1] and pϵ[0,1]. Preparation of this paper was partly supported by the Ministry of Education and Science (MTM 2005-03091).     

A Steffensen's type method in Banach spaces with applications on boundary-value problems

In this paper, a modified Steffensen's type iterative scheme for the numerical solution of a system of nonlinear equations is studied. Two convergence theorems are presented. The numerical solution of boundary-value problems by the multiple shooting method using the proposed iterative scheme is analyzed.     

Solution of finite systems of equations by interval iteration

In actual practice, iteration methods applied to the solution of finite systems of equations yield inconclusive results as to the existence or nonexistence of solutions and the accuracy of any approximate solutions obtained. On the other hand, construction of interval extensions of ordinary iteration operators permits one to carry out interval iteration computationally, with results which can give rigorous guarantees of existence or nonexistence of solutions, and error bounds for approximate solutions. Examples are given of the solution of a nonlinear system of equations and the calculation of eigenvalues and eigenvectors of a matrix by interval iteration. Several ways to obtain lower and upper bounds for eigenvalues are given.Sponsored by the United States Army under Contract No. DAAG29-80-C-0041.