Processing of Prior-Information in Statistics by Projections on Convex Cones

  • E. Rödel
Conference paper
Part of the International Centre for Mechanical Sciences book series (CISM, volume 382)


We investigate a Random-Search-Algorithm for finding the projection on a closed convex cone in R P with respect to a norm defined by any positive definite matrix. It is shown that this algorithm converges almost surely. The power of the algorithm is demonstrated by examples from statistics in which processing of prior information may be formulated as projections of parametervectors on polyhedral cones.

Key words

Random search projection on a convex cone optimization in statistics statistical estimation under prior information. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barlow, R.E.; Bartholomew, D.J.; Bremner, J.M.; Brunk, H.D,: Statistical Inference under Order Restrictions. Wiley, New York 1972.zbMATHGoogle Scholar
  2. 2.
    Fletcher, R. Practical Methods of Optimization. Wiley, New York 1993Google Scholar
  3. 3.
    Karr, A.F.: Probability. Springer, New York 1993CrossRefzbMATHGoogle Scholar
  4. 4.
    Rödel, E.: R-Estimation of Normed Bivariate Density Functions. statistics 18 (1987), 573–585.zbMATHGoogle Scholar
  5. 5.
    Zabinsky, Z.B.; Smith, R.L.: Pure Adaptive Search in Global Optimization. Mathematical Programming 53 (1992), 323–338.CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Wien 1997

Authors and Affiliations

  • E. Rödel
    • 1
  1. 1.Humboldt University BerlinBerlinGermany

Personalised recommendations