Skip to main content
Log in

Partitioned variable metric updates for large structured optimization problems

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

This paper presents a minimization method based on the idea of partitioned updating of the Hessian matrix in the case where the objective function can be decomposed in a sum of convex “element” functions. This situation occurs in a large class of practical problems including nonlinear finite elements calculations. Some theoretical and algorithmic properties of the update are discussed and encouraging numerical results are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Axelsson, O.: Solution of linear systems of equations: Iterative Methods. In: Sparse matrix techniques. V.A. Baker ed. Copenhagen 1976. Springer Verlag Berlin 1976

    Google Scholar 

  2. Brandt, A.: Multi-level adaptative solutions to boundary value problems. Math. Comput.31, 333–390 (1977)

    Google Scholar 

  3. Davidon, W.C.: Variable metric method for minimization. Technical Report #ANL-5990 (Rev.), Argonne National Laboratory, Research and Development 1959

  4. Dennis, J.E., Moré, J.J.: Quasi-Newton methods: Motivation and theory. SIAM Rev.19, 46–89 (1977)

    Google Scholar 

  5. Dixon, L.C.W.: The solution of the Navier-Stokes equations via finite elements and optimization on a parallel processor. Presented at the CEC/CREST International Summer School on Numerical Algorithms for Parallel Processors. Bergamo, Italy June 1981

  6. Ekeland, I., Temam, R.: Convex analysis and variational problems. North-Holland: Amsterdam 1976

    Google Scholar 

  7. Fletcher, R., Powell, M.J.D.: On the modification ofLDL 1 factorisations. Math. Comput.28, 1067–1087 (1974)

    Google Scholar 

  8. Gill, P., Murray, W.: Conjugate gradient methods for large scale nonlinear optimization. Technical Report SOL 79-15, Department of Operations Research, Stanford University, Stanford 1979

  9. Greenstadt, J.: Variations upon variable metric methods. Math. Comput.24, 1–18 (1970)

    Google Scholar 

  10. Griewank, A., Toint, Ph.L.: On the unconstrained optimization of partially separable functions. In: Nonlinear optimization, M.J.D. Powell ed. Academic Press: New York (1981)

    Google Scholar 

  11. Gustafsson, I.: Stability and rate of convergence of modified incomplete factorisation methods. Research Report 79.02 R Department of Computer Science, University of Göteborg (1979)

  12. Huang, H.Y.: Unified Approach to quadratically convergent algorithms for function minimization. J. Optimization Theory Appl.5, 405–423 (1970)

    Article  Google Scholar 

  13. Kamat, M.P., Vanden Brink, D.J., Watson, L.T.: Non-linear structural analysis using quasi-Newton minimization algorithms that exploit sparsity. Presented at the International Conference on Numerical Methods for Nonlinear Problems, Swansea, U.K. (1980)

  14. Marwil, E.: Exploiting sparsity in Newton-like methods. PhD thesis, Cornell University, Ithaca, New York (1978)

    Google Scholar 

  15. Oren, S.S., Spedicato, E.: Optimal conditioning of self-scaling variable metric algorithms. Math. Programming10, 70–90 (1976)

    Google Scholar 

  16. Powell, M.J.D.: Restart procedures for the conjugate gradient method. Math. Programming12, 241–254 (1977)

    Google Scholar 

  17. Powell, M.J.D.: Some global convergence properties of a variable metric algorithm for minimization without exact line searches. SIAM-AMS Proceedings9, 53–72 (1976)

    Google Scholar 

  18. Shanno, D.F.: On variable metric methods for sparse hessians. Math. Comput.34, 499–514 (1980)

    Google Scholar 

  19. Shanno, D.F., Phua, K.H.: Matrix conditionning and nonlinear optimization. Math. Programming14 (1978)

  20. Stetter, H.J.: Analysis of discretization methods for ordinary differential equations. Springer tracts on Natural Philosophy23 (1973)

  21. Toint, Ph.L.: On sparse and symmetric matrix updating subject to a linear equation. Math. Comput.31, 954–961 (1977)

    Google Scholar 

  22. Toint, Ph.L.: A note on sparsity exploiting quasi-Newton methods. Math. Programming21, 172–181 (1981)

    Google Scholar 

  23. Toint, Ph.L.: Towards an efficient sparsity exploiting Newton method. In: Sparse matrices and their uses. I.S. Duff ed. Academic Press: New York 1981

    Google Scholar 

  24. Toint, Ph.L., Strodiot, J.J.: An algorithm for unconstrained minimization of large scale problems by Decomposition in subspaces. Technical Report 76/1. Department of Maths, FUN Namur, Belgium 1976

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Work supported by a research grant of the Deutsche Forschungsgemeinschaft, Bonn, FRG

Rights and permissions

Reprints and permissions

About this article

Cite this article

Griewank, A., Toint, P.L. Partitioned variable metric updates for large structured optimization problems. Numer. Math. 39, 119–137 (1982). https://doi.org/10.1007/BF01399316

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01399316

Subject Classifications

Navigation