On preconditioned Uzawa methods and SOR methods for saddle-point problems
type: Item
instance of: scholarly article
title: On preconditioned Uzawa methods and SOR methods for saddle-point problems
zbMATH Open document ID: 0935.65055
DOI: 10.1016/S0377-0427(98)00197-6
author: Xiaojun Chen
published in: Journal of Computational and Applied Mathematics
publication date: 1999-08-22T00:00:00Z
Mathematics Subject Classification ID: 65H10
zbMATH DE Number: 1326438
zbMATH Keywords: successive overrelaxation
zbMATH Keywords: nonsmooth equation
zbMATH Keywords: convergence
zbMATH Keywords: inexact Uzawa method
zbMATH Keywords: SOR-Newton method
zbMATH Keywords: SOR-BFGS method
zbMATH Keywords: preconditioners
zbMATH Keywords: saddle-point problems
MaRDI profile type: Publication
cites work: A class of iterative methods for solving saddle point problems
cites work: Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
cites work: Convergence of the BFGS Method for $LC^1 $ Convex Constrained Optimization
cites work: Global and Superlinear Convergence of Inexact Uzawa Methods for Saddle Point Problems with Nondifferentiable Mappings
cites work: A parallel inexact Newton method for stochastic programs with recourse
cites work: Q4000274
cites work: A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
cites work: Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
cites work: Q4226179
cites work: Q4362807
cites work: Q4040931
cites work: On SOR Waveform Relaxation Methods
cites work: Fast Algorithms for Nonsmooth Compact Fixed-Point Problems
cites work: Fixed-Point Quasi-Newton Methods
cites work: SOR-Secant Methods
cites work: Q5652137
cites work: Newton's Method for B-Differentiable Equations
cites work: Nonsmooth Equations: Motivation and Algorithms
cites work: Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
cites work: Q5638112
cites work: Q3812039
cites work: A Preconditioned Iterative Method for Saddlepoint Problems
cites work: Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
cites work: On nonlinear SOR-like methods. I: Applications to simultaneous methods for polynomial zeros
full work available at URL: s0377-0427(98)00197-6
OpenAlex ID: W2016926224
description: scientific article; zbMATH DE number 1326438