AbstractThis paper studies convergence analysis of a preconditioned inexact Uzawa method for nondifferentiable saddle-point problems. The SOR-Newton method and the SOR-BFGS method are special cases of this method. We relax the Bramble-Pasciak-Vassilev condition on preconditioners for convergence of the inexact Uzawa method for linear saddle-point problems. The relaxed condition is used to determine the relaxation parameters in the SOR-Newton method and the SOR-BFGS method. Furthermore, we study global convergence of the multistep inexact Uzawa method for nondifferentiable saddle-point problems
The Kaczmarz method is presented for solving saddle point systems. The convergence is analyzed. Nume...
The solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints...
We study different types of stationary iterative methods for solving a class of large, sparse linear...
AbstractThis paper studies convergence analysis of a preconditioned inexact Uzawa method for nondiff...
Inexact Uzawa algorithms for solving nonlinear saddle-point problems are proposed. A simple sufficie...
In this paper, we propose an inexact Uzawa method with variable relaxation parameters for iterativel...
AbstractIn this paper we discuss the convergence behavior of the nonlinear inexact Uzawa algorithm f...
AbstractBai et al. recently proposed an efficient parameterized Uzawa method for solving the nonsing...
AbstractThe parameterized Uzawa preconditioners for saddle point problems are studied in this paper....
© 2018, Pleiades Publishing, Ltd. For finite-dimensional saddle point problem with a nonlinear monot...
In this note, we discuss the convergence behavior of a modified inexact Uzawa algorithm for solving ...
AbstractIn this paper, the convergence property of the inexact Uzawa algorithm for solving symmetric...
AbstractFor the large sparse saddle point problems, Bai et al. recently studied a class of parameter...
Abstract. In this paper, we introduce and analyze Uzawa algorithms for non-symmetric saddle point sy...
We consider the iterative solution of linear systems with a symmetric saddle point system matrix. We...
The Kaczmarz method is presented for solving saddle point systems. The convergence is analyzed. Nume...
The solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints...
We study different types of stationary iterative methods for solving a class of large, sparse linear...
AbstractThis paper studies convergence analysis of a preconditioned inexact Uzawa method for nondiff...
Inexact Uzawa algorithms for solving nonlinear saddle-point problems are proposed. A simple sufficie...
In this paper, we propose an inexact Uzawa method with variable relaxation parameters for iterativel...
AbstractIn this paper we discuss the convergence behavior of the nonlinear inexact Uzawa algorithm f...
AbstractBai et al. recently proposed an efficient parameterized Uzawa method for solving the nonsing...
AbstractThe parameterized Uzawa preconditioners for saddle point problems are studied in this paper....
© 2018, Pleiades Publishing, Ltd. For finite-dimensional saddle point problem with a nonlinear monot...
In this note, we discuss the convergence behavior of a modified inexact Uzawa algorithm for solving ...
AbstractIn this paper, the convergence property of the inexact Uzawa algorithm for solving symmetric...
AbstractFor the large sparse saddle point problems, Bai et al. recently studied a class of parameter...
Abstract. In this paper, we introduce and analyze Uzawa algorithms for non-symmetric saddle point sy...
We consider the iterative solution of linear systems with a symmetric saddle point system matrix. We...
The Kaczmarz method is presented for solving saddle point systems. The convergence is analyzed. Nume...
The solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints...
We study different types of stationary iterative methods for solving a class of large, sparse linear...