Skip to main content
SpringerLink
Log in

A note on solution of large sparse maximum entropy problems with linear equality constraints

  • Published:
Mathematical Programming Submit manuscript

Abstract

This paper describes a method to solve large sparse maximum entropy problems with linear equality constraints using Newtons and the conjugate gradient method. A numerical example is given to introduce the reader to possible applications of entropy models and this method. Some experience from large scale problems is also reported.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Å. Björck and T. Elfving, “Accelerated projection methods for computing pseudo-inverse solutions of systems of linear equations”, Report LiTH-MAT-R-78-5, Linköping University, Linköping (1978).

    Google Scholar 

  2. J. Eriksson, “Solution of large sparse maximum entropy problems with linear equality constraints”, Report LiTH-MAT-R-78-2, Linköping University, Linköping (1978).

    Google Scholar 

  3. S. Erlander, “Entropy in linear programs—an approach to planning”, Report LiTH-MAT-R-77-3, Linköping University, Linköping (1977).

    Google Scholar 

  4. G. Hadley,Nonlinear and dynamic programming (Addison-Wesley, London, 1970).

    Google Scholar 

  5. S. Kullback,Information theory and statistics (Wiley, New York, 1959).

    Google Scholar 

  6. J.M. Ortega and W.C. Rheinboldt,Iterative solution of nonlinear equations in several variables (Academic Press, New York, 1970).

    Google Scholar 

  7. V. Pereyra, “Convergence of discretization algorithms”,SIAM Journal on Numerical Analysis 4 (1967) 508–533.

    Google Scholar 

  8. J.K. Reid, “On the method of conjugate gradients for the solution of large sparse systems of linear equations”, in: J.K. Reid, ed.,Large sparse sets of linear equations (Academic Press, New York, 1971) pp. 231–254.

    Google Scholar 

  9. A. van der Sluis, “Condition numbers and equilibration of matrices”,Numerische Mathematik 14 (1969) 14–23.

    Google Scholar 

  10. F. Snickars and W. Weibull, “A minimum information principle—theory and practice”,Regional Science and Urban Economics 7 (1977) 137–168.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Linköping University, Sweden

    Jan Eriksson

Authors
  1. Jan Eriksson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eriksson, J. A note on solution of large sparse maximum entropy problems with linear equality constraints. Mathematical Programming 18, 146–154 (1980). https://doi.org/10.1007/BF01588310

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation