Fast Multivariate Log-Concave Density Estimation

McMullen, P., 1970. The maximum numbers of faces of a convex polytope. Mathematika 17 (2), 179–184

1970

Earlier work this paper cites.

Dempster, A. P., Laird, N. M., Rubin, D. B., 1977. Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. Series B Stat. Methodol. 39 (1), 1–38

1977

Earlier work this paper cites.

Grundmann, A., Möller, H.-M., 1978. Invariant integration formulas for the n-simplex by combinatorial methods. SIAM J. Numer. Anal. 15 (2), 282–290

1978

Earlier work this paper cites.

Silverman, B., 1982. On the estimation of a probability density function by the maximum penalized likelihood method. Ann. Stat. 10 (3), 795–810

1982

Earlier work this paper cites.

Dwyer, R. A., 1991. Higher-dimensional voronoi diagrams in linear expected time. Discrete Comput. Geom. 6, 343–367

1991

Earlier work this paper cites.

Barber, C. B., Dobkin, D. P., Huhdanpaa, H., 1996. The quickhull algorithm for convex hulls. ACM T. Math. Software 22 (4), 469–483

1996

Earlier work this paper cites.

Dagum, L., Menon, R., 1998. Openmp: An industry-standard API for shared-memory programming. IEEE Comput. Sci. Eng. 5 (1), 46–55

1998

Earlier work this paper cites.

Li, D.-H., Fukushima, M., 2001. A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math 129 (1), 15–35

2001

Earlier work this paper cites.

Bungartz, H.-J., Griebel, M., 2004. Sparse Grids. Acta Numer. 13, 147–269

2004

Earlier work this paper cites.

Bhatia, R., 2006. Positive Definite Matrices. Princeton Univ. Press

2006

Earlier work this paper cites.

Lovász, L., Vempala, S., 2006. Fast algorithms for log-concave functions: Sampling, rounding, integration and optimization. In: Foundations of Computer Science (FOCS). IEEE, pp. 57–68

2006

Cited alongside, same era.

Nocedal, J., Wright, S., 2006. Numerical Optimization. Springer Science & Business Media

2006

Cited alongside, same era.

Dümbgen, L., Hüsler, A., Rufibach, K., 2007. Active set and EM algorithms for logconcave densities based on complete and censored data. Tech. Rep. 61, University of Bern

2007

Cited alongside, same era.

Lovász, L., Vempala, S., 2007. The geometry of log-concave functions and sampling algorithms. Rand. Structures Alg. 30 (3), 307–358

2007

Cited alongside, same era.

Dümbgen, L., Rufibach, K., 2009. Maximum likelihood estimation of a log-concave density and its distribution function: Basic properties and uniform consistency. Bernoulli 15 (1), 40–68

Rudolf, D., 2013. Hit-and-run for numerical integration. In: Monte Carlo and Quasi-Monte Carlo Methods 2012. Vol. 65. Springer, pp. 597–612

2012

Later among the works it cites.

Ueberhuber, C. W., 2012. Numerical Computation 1: Methods, Software, and Analysis. Springer Science & Business Media

Original

2012

Later among the works it cites.

Chen, Y., Samworth, R. J., 2013. Smoothed log-concave maximum likelihood estimation with applications. Statist. Sinica 23

2013

Later among the works it cites.

Acharya, J., Diakonikolas, I., Li, J., Schmidt, L., 2017. Sample-optimal density estimation in nearly-linear time. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 1278–1289

2017

Later among the works it cites.

Diakonikolas, I., Kane, D. M., Stewart, A., 2017. Learning multivariate log-concave distributions. In: Kale, S., Shamir, O. (Eds.), Proceedings of the 2017 Conference on Learning Theory, PMLR. Vol. 65. pp. 711–727