Skip to main content

An Algorithm for the Approximation of N-Dimensional Distributions

  • Conference paper
Compstat
  • 226 Accesses

Summary

An algorithm for approximation and parameter estimation leading to L1 and L- optimization is presented, and for numerical computation Karmarkar’s linear programming algorithm is adapted, Keywords: approximation, estimation, linear programming, computer aided design, finite mixture distribution

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • GORDESCH, J. (1988). Fitting n-Dimensional Distributions. Research Paper, Free University Berlin, Institute of Sociology (to appear).

    Google Scholar 

  • HERING, E., and SCHEURER, K. (1988), Operations Research mit dem PC. Braunschweig.

    MATH  Google Scholar 

  • KARMARKAR, N. K. (1984). A new polynomial-time algorithm for linear programming. Combinatoria 4, 373–395.

    Article  MathSciNet  MATH  Google Scholar 

  • KRABS, W. (1966). Ein Verfahren zur Lösung der diskreten rationalen Approximationsaufgabe. ZAMM 46, 63–66.

    MathSciNet  Google Scholar 

  • KRABS, W. (1969). Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems. Computing 4, 216–224.

    Article  MathSciNet  MATH  Google Scholar 

  • LEMPIO, F. (1971). Lineare Optimierung in unendlich-dimensionalen Vektorräumen. Computing 8, 284–290.

    Article  MathSciNet  MATH  Google Scholar 

  • MARITZ, J. S. (1984). Distribution-Free Statistical Methods. London - New York.

    Google Scholar 

  • MARSAGLIA, G. (1970). One-sided approximation by linear combinations of functions. Approximation Theory, ed. by A. Talbot. New York - London, 233–242.

    Google Scholar 

  • ORTEGA, J. M., and RHEINBOLDT, W. C. (1970). Iterative Solution of Nonlinear Equations in Several Variables. New York -London.

    MATH  Google Scholar 

  • ROCKET, A. M., and J. C. STEVENSON (1987): Karmarkar’s algorithm. BYTE, Sept., 146–160 (Corrections: Dec. 1987, 32).

    Google Scholar 

  • STIEFEL, E. (1959). Ãœber diskrete und lineare Tschebyscheff-Ap-proximationen. Num. Math. 1, 1–28.

    Article  MathSciNet  MATH  Google Scholar 

  • STIEFEL, E. (1960). Note on Jordan elimination, linear programming and Tschebyscheff approximation. Num. Math. 2, 1–17.

    Article  MathSciNet  MATH  Google Scholar 

  • TITTERINGTON, D. M., SMITH, A. F. M., and MAKOV, U. E. (1985). Statistical Analysis of Finite Mixture Distributions. Chichester (U. K.).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Physica-Verlag Heidelberg

About this paper

Cite this paper

Gordesch, J. (1988). An Algorithm for the Approximation of N-Dimensional Distributions. In: Edwards, D., Raun, N.E. (eds) Compstat. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-46900-8_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46900-8_39

  • Publisher Name: Physica-Verlag HD

  • Print ISBN: 978-3-7908-0411-9

  • Online ISBN: 978-3-642-46900-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics