Fitting Tractable Convex Sets to Support Function Evaluations
暂无分享,去创建一个
[1] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[2] Arkadi Nemirovski,et al. On Polyhedral Approximations of the Second-Order Cone , 2001, Math. Oper. Res..
[3] M. Yannakakis. Expressing combinatorial optimization problems by linear programs , 1991, Symposium on the Theory of Computing.
[4] J. Yukich,et al. Some new Vapnik-Chervonenkis classes , 1989 .
[5] P. Gaenssler,et al. Empirical Processes: A Survey of Results for Independent and Identically Distributed Random Variables , 1979 .
[6] Gennadiy Averkov,et al. Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization , 2018, SIAM J. Appl. Algebra Geom..
[7] B. L. Waerden,et al. Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz? , 1951 .
[8] M. Kosorok. Introduction to Empirical Processes and Semiparametric Inference , 2008 .
[9] Henry Stark,et al. Shape estimation in computer tomography from minimal data , 1988 .
[10] Jens Gregor,et al. Three‐dimensional support function estimation and application for projection magnetic resonance imaging , 2002, Int. J. Imaging Syst. Technol..
[11] E. Bronstein. Approximation of convex sets by polytopes , 2008 .
[12] Meena Mahajan,et al. The Planar k-means Problem is NP-hard I , 2009 .
[13] S. Dasgupta. The hardness of k-means clustering , 2008 .
[14] S. Smale. Mathematical problems for the next century , 1998 .
[15] Richard J. Gardner,et al. A New Algorithm for 3D Reconstruction from Support Functions , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[16] Nicholas I. Fisher,et al. On the Estimation of a Convex Set from Noisy Data on its Support Function , 1997 .
[17] Stephen P. Boyd,et al. Convex piecewise-linear fitting , 2009 .
[18] D. Pollard. Strong Consistency of $K$-Means Clustering , 1981 .
[19] Adityanand Guntuboyina. Optimal rates of convergence for convex set estimation from support functions , 2011, 1108.5341.
[20] Peter Hall,et al. On the Estimation of a Convex Set With Corners , 1999, IEEE Trans. Pattern Anal. Mach. Intell..
[21] S. P. Lloyd,et al. Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.
[22] Jerry L. Prince,et al. Reconstructing Convex Sets from Support Line Measurements , 1990, IEEE Trans. Pattern Anal. Mach. Intell..
[23] Ludwig Danzer,et al. Finite point-sets on S2 with minimum distance as large as possible , 1986, Discret. Math..
[24] Sanjeev R. Kulkarni,et al. Convex-polygon estimation from support-line measurements and applications to target reconstruction from laser-radar data , 1992 .
[25] P. Tammes. On the origin of number and arrangement of the places of exit on the surface of pollen-grains , 1930 .
[26] R. Schneider. Convex Bodies: The Brunn–Minkowski Theory: Minkowski addition , 1993 .
[27] Adityanand Guntuboyina,et al. Adaptive estimation of planar convex sets , 2015, The Annals of Statistics.
[28] P. Milanfar,et al. Convergence of algorithms for reconstructing convex bodies and directional measures , 2006, math/0608011.
[29] Meena Mahajan,et al. The planar k-means problem is NP-hard , 2012, Theor. Comput. Sci..
[30] D. Pollard. Convergence of stochastic processes , 1984 .
[31] Rekha R. Thomas,et al. Lifts of Convex Sets and Cone Factorizations , 2011, Math. Oper. Res..
[32] James Saunderson,et al. Limitations on the Expressive Power of Convex Cones without Long Chains of Faces , 2019, SIAM J. Optim..