Element-by-Element Preconditioners for Large Partially Separable Optimization Problems

We study the solution of large-scale nonlinear optimization problems by methods which aim to exploit their inherent structure. In particular, we consider the property of partial separability, first studied by Griewank and Toint [Nonlinear Optimization, 1981, pp. 301--312]. A typical minimization method for nonlinear optimization problems approximately solves a sequence of simplified linearized subproblems. In this paper, we explore how partial separability may be exploited by iterative methods for solving these subproblems. We particularly address the issue of computing effective preconditioners for such iterative methods. We concentrate on element-by-element preconditioners which reflect the structure of the problem. We find that the performance of these methods can be considerably improved by amalgamating elements before applying the preconditioners. We report the results of numerical experiments which demonstrate the effectiveness of this approach.

[1]  Henk A. van der Vorst,et al.  The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers , 1986, Parallel Comput..

[2]  Philip E. Gill,et al.  Practical optimization , 1981 .

[3]  Youcef Saad,et al.  A Basic Tool Kit for Sparse Matrix Computations , 1990 .

[4]  O. Axelsson.  Solution of linear systems of equations: Iterative methods , 1977 .

[5]  Beresford N. Parlett,et al.  Element Preconditioning Using Splitting Techniques , 1985 .

[6]  M. Hestenes.  Multiplier and gradient methods , 1969 .

[7]  T. Hughes,et al.  An element-by-element solution algorithm for problems of structural and solid mechanics , 1983 .

[8]  John K. Reid,et al.  The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.

[9]  Nicholas I. M. Gould,et al.  CUTE: constrained and unconstrained testing environment , 1995, TOMS.

[10]  S. Nash.  Newton-Type Minimization via the Lanczos Method , 1984 .

[11]  T. Chan,et al.  Computing a search direction for large scale linearly constrained nonlinear optimization calculations , 1993 .

[12]  J. L’Excellent,et al.  On the use of element-by-element preconditioners to solve large scale partially separable optimization problems , 1995 .

[13]  John G. Lewis,et al.  Sparse matrix test problems , 1982, SGNM.

[14]  P. Toint,et al.  Partitioned variable metric updates for large structured optimization problems , 1982 .

[15]  Nicholas J. Higham,et al.  The Accuracy of Floating Point Summation , 1993, SIAM J. Sci. Comput..

[16]  Nicholas I. M. Gould,et al.  Large-scale nonlinear constrained optimization , 1992 .

[17]  E. F. Kaasschieter,et al.  A general finite element preconditioning for the conjugate gradient method , 1989 .

[18]  Andreas Griewank,et al.  On the existence of convex decompositions of partially separable functions , 1984, Math. Program..

[19]  I. Gustafsson,et al.  A preconditioning technique based on element matrix factorizations , 1986 .

[20]  J. Z. Zhu,et al.  The finite element method , 1977 .

[21]  A. J. Wathen,et al.  An analysis of some element-by-element techniques , 1989 .

[22]  Bruce M. Irons,et al.  A frontal solution program for finite element analysis , 1970 .

[23]  Thomas J. R. Hughes,et al.  LARGE-SCALE VECTORIZED IMPLICIT CALCULATIONS IN SOLID MECHANICS ON A CRAY X-MP/48 UTILIZING EBE PRECONDITIONED CONJUGATE GRADIENTS. , 1986 .

[24]  Philip E. Gill,et al.  Numerical methods for constrained optimization , 1974 .

[25]  M. Vidrascu,et al.  An element-by-element preconditioned conjugate gradient method implemented on a vector computer , 1991, Parallel Comput..

[26]  M. J. D. Powell,et al.  A method for nonlinear constraints in minimization problems , 1969 .