On preconditioned Uzawa methods and SOR methods for saddle-point problems
From MaRDI portal
Publication:1298659
DOI10.1016/S0377-0427(98)00197-6zbMath0935.65055OpenAlexW2016926224MaRDI QIDQ1298659
Publication date: 22 August 1999
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(98)00197-6
convergencesuccessive overrelaxationpreconditionersnonsmooth equationsaddle-point problemsinexact Uzawa methodSOR-Newton methodSOR-BFGS method
Related Items
On HSS-based sequential two-stage method for non-Hermitian saddle point problems ⋮ Variable parameter Uzawa method for solving a class of block three-by-three saddle point problems ⋮ The BGS-Uzawa and BJ-Uzawa iterative methods for solving the saddle point problem ⋮ A sufficient condition for the convergence of the inexact Uzawa algorithm for saddle point problems ⋮ Spectral analysis, properties and nonsingular preconditioners for singular saddle point problems ⋮ Application of modified homotopy perturbation method for solving the augmented systems ⋮ On convergence of SOR methods for nonsmooth equations ⋮ A new generalized parameterized inexact Uzawa method for solving saddle point problems ⋮ An inexact relaxed DPSS preconditioner for saddle point problem ⋮ SSOR-like methods for saddle point problems ⋮ A simplified PSS preconditioner for non-Hermitian generalized saddle point problems ⋮ Transformed primal-dual methods for nonlinear saddle point systems ⋮ A linear algebra perspective on the random multi-block ADMM: the QP case ⋮ On generalized local Hermitian and skew-Hermitian splitting iterative method for block two-by-two linear systems ⋮ A generalization of the local Hermitian and skew-Hermitian splitting iteration methods for the non-Hermitian saddle point problems ⋮ A block product preconditioner for saddle point problems ⋮ The nonlinear inexact Uzawa hybrid algorithms based on one-step Newton method for solving nonlinear saddle-point problems ⋮ Convergence analysis of the splitting-based iterative method for solving generalized saddle point problems ⋮ A generalization of parameterized inexact Uzawa method for generalized saddle point problems ⋮ ANALYSIS OF THE INEXACT UZAWA ALGORITHMS FOR NONLINEAR SADDLE-POINT PROBLEMS ⋮ Semi-convergence analysis of the GPIU method for singular nonsymmetric saddle-point problems ⋮ On parameterized block symmetric positive definite preconditioners for a class of block three-by-three saddle point problems ⋮ The preconditioned iterative methods with variable parameters for saddle point problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- On nonlinear SOR-like methods. I: Applications to simultaneous methods for polynomial zeros
- A class of iterative methods for solving saddle point problems
- A parallel inexact Newton method for stochastic programs with recourse
- Nonsmooth Equations: Motivation and Algorithms
- Newton's Method for B-Differentiable Equations
- Convergence of the BFGS Method for $LC^1 $ Convex Constrained Optimization
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- A Preconditioned Iterative Method for Saddlepoint Problems
- Fixed-Point Quasi-Newton Methods
- Fast Algorithms for Nonsmooth Compact Fixed-Point Problems
- SOR-Secant Methods
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
- Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
- On SOR Waveform Relaxation Methods
- Global and Superlinear Convergence of Inexact Uzawa Methods for Saddle Point Problems with Nondifferentiable Mappings
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
