Displaying similar documents to “Convergence of a short-step primal-dual algorithm based on the Gauss-Newton direction.”

A semi-smooth Newton method for solving elliptic equations with gradient constraints

Roland Griesse, Karl Kunisch (2009)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

Semi-smooth Newton methods for elliptic equations with gradient constraints are investigated. The one- and multi-dimensional cases are treated separately. Numerical examples illustrate the approach and as well as structural features of the solution.

Convergent algorithms suitable for the solution of the semiconductor device equations

Miroslav Pospíšek (1995)

Applications of Mathematics

Similarity:

In this paper, two algorithms are proposed to solve systems of algebraic equations generated by a discretization procedure of the weak formulation of boundary value problems for systems of nonlinear elliptic equations. The first algorithm, Newton-CG-MG, is suitable for systems with gradient mappings, while the second, Newton-CE-MG, can be applied to more general systems. Convergence theorems are proved and application to the semiconductor device modelling is described.

Newton's iteration with a conjugate gradient based decomposition method for an elliptic PDE with a nonlinear boundary condition

Jonas Koko (2004)

International Journal of Applied Mathematics and Computer Science

Similarity:

Newton's iteration is studied for the numerical solution of an elliptic PDE with nonlinear boundary conditions. At each iteration of Newton's method, a conjugate gradient based decomposition method is applied to the matrix of the linearized system. The decomposition is such that all the remaining linear systems have the same constant matrix. Numerical results confirm the savings with respect to the computational cost, compared with the classical Newton method with factorization at each...

Newton methods for solving two classes of nonsmooth equations

Yan Gao (2001)

Applications of Mathematics

Similarity:

The paper is devoted to two systems of nonsmooth equations. One is the system of equations of max-type functions and the other is the system of equations of smooth compositions of max-type functions. The Newton and approximate Newton methods for these two systems are proposed. The Q-superlinear convergence of the Newton methods and the Q-linear convergence of the approximate Newton methods are established. The present methods can be more easily implemented than the previous ones, since...

On the semilocal convergence of a two-step Newton-like projection method for ill-posed equations

Ioannis K. Argyros, Santhosh George (2013)

Applicationes Mathematicae

Similarity:

We present new semilocal convergence conditions for a two-step Newton-like projection method of Lavrentiev regularization for solving ill-posed equations in a Hilbert space setting. The new convergence conditions are weaker than in earlier studies. Examples are presented to show that older convergence conditions are not satisfied but the new conditions are satisfied.

A convergence analysis of Newton-like methods for singular equations using outer or generalized inverses

Ioannis K. Argyros (2005)

Applicationes Mathematicae

Similarity:

The Newton-Kantorovich approach and the majorant principle are used to provide new local and semilocal convergence results for Newton-like methods using outer or generalized inverses in a Banach space setting. Using the same conditions as before, we provide more precise information on the location of the solution and on the error bounds on the distances involved. Moreover since our Newton-Kantorovich-type hypothesis is weaker than before, we can cover cases where the original Newton-Kantorovich...