On preconditioned Uzawa methods and SOR methods for saddle-point problems

This 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.

[1]  Xiaojun Chen,et al.  A parallel inexact newton method for stochastic programs with recourse , 1996, Ann. Oper. Res..

[2]  P. G. Ciarlet,et al.  Introduction to Numerical Linear Algebra and Optimisation , 1989 .

[3]  P. Tseng.  Applications of splitting algorithm to decomposition in convex programming and variational inequalities , 1991 .

[4]  José Mario Martínez.  SOR-secant methods , 1994 .

[5]  Jong-Shi Pang,et al.  Nonsmooth Equations: Motivation and Algorithms , 1993, SIAM J. Optim..

[6]  Ragnar Winther,et al.  A Preconditioned Iterative Method for Saddlepoint Problems , 1992, SIAM J. Matrix Anal. Appl..

[7]  Xiaojun Chen.  Global and Superlinear Convergence of Inexact Uzawa Methods for Saddle Point Problems with Nondiffer , 1998 .

[8]  O. Axelsson,et al.  On the solution of nonlinear equations for nondifferentiable mappings , 1995 .

[9]  C. Kelley,et al.  Fast algorithms for nonsmooth compact fixed-point problems , 1992 .

[10]  Liqun Qi,et al.  Superlinearly convergent approximate Newton methods for LC1 optimization problems , 1994, Math. Program..

[11]  Xiaojun Chen,et al.  Convergence of the BFGS Method for LC 1 Convex Constrained Optimization , 1996 .

[12]  Roger Fletcher,et al.  Practical methods of optimization; (2nd ed.) , 1987 .

[13]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[14]  R. Bank,et al.  A class of iterative methods for solving saddle point problems , 1989 .

[15]  G. Golub,et al.  Inexact and preconditioned Uzawa algorithms for saddle point problems , 1994 .

[16]  On nonlinear SOR-like methods, I — Applications to simultaneous methods for polynomial zeros , 1997 .

[17]  J. J. Moré,et al.  A Characterization of Superlinear Convergence and its Application to Quasi-Newton Methods , 1973 .

[18]  Stefan Vandewalle,et al.  SOR WAVEFORM , 1997 .

[19]  Apostol T. Vassilev,et al.  Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems , 1997 .

[20]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[21]  Fast Solvers for Non-Linear FEM-BEM Equations , 1997 .

[22]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[23]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[24]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[25]  J. M. Martínez,et al.  Fixed-point quasi-Newton methods , 1992 .

[26]  Jong-Shi Pang,et al.  Newton's Method for B-Differentiable Equations , 1990, Math. Oper. Res..

[27]  Roger J.-B. Wets,et al.  Linear-quadratic programming problems with stochastic penalties: The finite generation algorithm , 1986 .