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 solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints...
The solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints...
We present a new class of iterative schemes for large scale set-valued saddle point problems as aris...
AbstractThis paper studies convergence analysis of a preconditioned inexact Uzawa method for nondiff...
AbstractBai et al. recently proposed an efficient parameterized Uzawa method for solving the nonsing...
AbstractIn this paper, the convergence property of the inexact Uzawa algorithm for solving symmetric...
Inexact Uzawa algorithms for solving nonlinear saddle-point problems are proposed. A simple sufficie...
© 2018, Pleiades Publishing, Ltd. For finite-dimensional saddle point problem with a nonlinear monot...
AbstractIn this paper, a bound of rate for a slight modification of the inexact Uzawa algorithm for ...
AbstractFor the large sparse saddle point problems, Bai et al. recently studied a class of parameter...
AbstractThe parameterized Uzawa preconditioners for saddle point problems are studied in this paper....
In this paper, we propose an inexact Uzawa method with variable relaxation parameters for iterativel...
We consider preconditioned Uzawa iterations for a saddle point Problem with inequality constraints a...
AbstractIn this paper we discuss the convergence behavior of the nonlinear inexact Uzawa algorithm f...
International audienceWe present a unified approach in analyzing Uzawa iterative algorithms for sadd...
The solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints...
The solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints...
We present a new class of iterative schemes for large scale set-valued saddle point problems as aris...
AbstractThis paper studies convergence analysis of a preconditioned inexact Uzawa method for nondiff...
AbstractBai et al. recently proposed an efficient parameterized Uzawa method for solving the nonsing...
AbstractIn this paper, the convergence property of the inexact Uzawa algorithm for solving symmetric...
Inexact Uzawa algorithms for solving nonlinear saddle-point problems are proposed. A simple sufficie...
© 2018, Pleiades Publishing, Ltd. For finite-dimensional saddle point problem with a nonlinear monot...
AbstractIn this paper, a bound of rate for a slight modification of the inexact Uzawa algorithm for ...
AbstractFor the large sparse saddle point problems, Bai et al. recently studied a class of parameter...
AbstractThe parameterized Uzawa preconditioners for saddle point problems are studied in this paper....
In this paper, we propose an inexact Uzawa method with variable relaxation parameters for iterativel...
We consider preconditioned Uzawa iterations for a saddle point Problem with inequality constraints a...
AbstractIn this paper we discuss the convergence behavior of the nonlinear inexact Uzawa algorithm f...
International audienceWe present a unified approach in analyzing Uzawa iterative algorithms for sadd...
The solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints...
The solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints...
We present a new class of iterative schemes for large scale set-valued saddle point problems as aris...