The finite element setting for nonlinear elliptic PDEs directly leads to the minimization of convex functionals. Uniform ellipticity of the underlying PDE shows up as strict convexity of the arising nonlinear functional. The paper analyzes computational variants of Newton’s method for convex optimization in an affine conjugate setting, which reflects the appropriate affine transformation behavi...

We design and study an adaptive algorithm for the numerical solution of the stationary nonlinear Stokes problem. The algorithm can be interpreted as a disturbed steepest descent method, which generalizes Uzawa’s method to the nonlinear case. The outer iteration for the pressure is a descent method with fixed step-size. The inner iteration for the velocity consists of an approximate solution of ...

Based on the general inner-outer (GIO) iteration method [5,34] and framework [6], we present a multi-step matrix splitting (GMMS) for computing PageRank, analyze its overall convergence property. Moreover, same idea can be used as preconditioning technique accelerating Krylov subspace methods, such GMRES method. Finally, several numerical examples are given to illustrate effectiveness of propos...

In order to control the accuracy of a preconditioner for an outer iterative process one often involves variable preconditioners. The variability may for instance be due to the use of inner iterations in the construction of the preconditioner. Both the outer and inner iterations may be based on some conjugate gradient type of method, e.g. generalized minimum residual methods. A background for su...

As long as a square nonnegative matrix A contains sufficient nonzero elements, then the matrix can be balanced, that is we can find a diagonal scaling of A that is doubly stochastic. A number of algorithms have been proposed to achieve the balancing, the most well known of these being the Sinkhorn-Knopp algorithm. In this paper we derive new algorithms based on inner-outer iteration schemes. We...

Title of dissertation: NUMERICAL SOLUTION OF EIGENVALUE PROBLEMS WITH SPECTRAL TRANSFORMATIONS Fei Xue, Doctor of Philosophy, 2009 Dissertation directed by: Professor Howard C. Elman Department of Computer Science Institute for Advanced Computer Studies This thesis is concerned with inexact eigenvalue algorithms for solving large and sparse algebraic eigenvalue problems with spectral transforma...

Two approximation algorithms for solving convex vector optimization problems (CVOPs) are provided. Both algorithms solve the CVOP and its geometric dual problem simultaneously. The first algorithm is an extension of Benson’s outer approximation algorithm, and the second one is a dual variant of it. Both algorithms provide an inner as well as an outer approximation of the (upper and lower) image...

A new nonlinear solution method is developed and applied to a non-equilibrium radiation di!usion problem. With this new method, Newton-like super-linear convergence is achieved in the nonlinear iteration, without the complexity of forming or inverting the Jacobian from a standard Newton method. The method is a unique combination of an outer Newton-based iteration and and inner conjugate gradien...

We develop a general convergence analysis for a class of inexact Newtontype regularizations for stably solving nonlinear ill-posed problems. Each of the methods under consideration consists of two components: the outer Newton iteration and an inner regularization scheme which, applied to the linearized system, provides the update. In this paper we give a novel and unified convergence analysis w...