Partitionability of Implicit Least Squares Model Fitting Problems
ARMY BALLISTIC RESEARCH LAB ABERDEEN PROVING GROUND MD
Pagination or Media Count:
Non-linear least squares model fitting problems differ from general optimization problems due to the special structure of the least squares normal equations. In simple least squares problems, that structure algorithmic simplification can be achieved. More general least squares problems can often be made partitionable by proper parameter manipulations. In this report, sufficient partitionability conditions are derived and parameter manipulations are discussed for the achievement of partitionability.
- Statistics and Probability