Molchanov, I. and Zuyev, S. (2002) Steepest descent algorithms in a space of measures. Statistics and Computing, 12, pp. 115-123.
Full text not currently available from Enlighten.
Abstract
The paper describes descent type algorithms suitable for solving optimisation problems for functionals that depend on measures. We mention several examples of such problems that appear in optimal design, cluster analysis and optimisation of spatial distribution of coverage processes.
Item Type: | Articles |
---|---|
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | UNSPECIFIED |
Authors: | Molchanov, I., and Zuyev, S. |
College/School: | College of Science and Engineering > School of Mathematics and Statistics > Statistics |
Journal Name: | Statistics and Computing |
Publisher: | Springer |
ISSN: | 0960-3174 |
ISSN (Online): | 1573-1375 |
University Staff: Request a correction | Enlighten Editors: Update this record