Convex Programming and Decomposition of Discrete Frequency Spectra.
Abstract
The decomposition of a given empirical frequency distribution into a finite mixture of distributions from an admissible class is posed as a convex programming problem. The convexity is attained with any of the usual statistical principles, e.g., minimum variance, maximum likelihood, minimum absolute deviations, by discretizing on the parameters (e.g., variance) that would yield non-convexity. Computational properties are explored in the context of decomposition of a blood-cell volume distribution and employ minimum absolute deviations. A new class of linear programming problems is thereby uncovered with excessive iteration counts on standard large-scale commerical computer codes. Computational results thus far indicate stability in selection of components of decomposition. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1971
- Accession Number
- AD0729243
Entities
People
- Abraham Charnes
- D. Klingman
- L. Crus-abad
Organizations
- University of Texas at Austin