Steepest descent algorithms in a space of measures
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.
steepest descent gradient methods k-means p-means optimal experimental design poisson process boolean model splus r