Norm-Induced Densities and Testing the Boundedness of a Convex Set

References

• Ball K. Logarithmically concave functions and sections of convex sets in ℛn. Studia Math. (1988) 88(1):69–84Google Scholar
• Bertsimas D., Vempala S. Solving convex programs by random walks. J. ACM (2004) 51(4):540–556Crossref, Google Scholar
• Casella G., Robert C. P.Monte Carlo Statistical Methods (1999) (Springer-Verlag, New York) Google Scholar
• de Ghellink G., Vial J.-P. A polynomial Newton method for linear programming. Algorithmica (1986) 1(1):425–453Crossref, Google Scholar
• Gromov M., Milman V. D. Brunn theorem and a concentration of volume for symmetric convex bodies. Israel Seminar on Geometrical Aspects of Functional Analysis (GAFA) (1984) (Tel Aviv University, Tel Aviv, Israel) . J. Lindenstrauss, ed., Paper V [in English]Google Scholar
• Iusem A., Seeger A. Axiomatization of the index of pointedness for closed convex cones. Math. Appl. Comput. (2005) 24(2):245–283Google Scholar
• Kalai A., Vempala S. Simulating annealing for convex optimization. Math. Oper. Res. (2008) . ForthcomingGoogle Scholar
• Khachiyan L. G. Rounding of polytopes in the real number model of computation. Math. Oper. Res. (1996) 21(2):307–320Link, Google Scholar
• Lovász L. Hit-and-run mixes fast. Math. Programming (1998) 86:443–461Google Scholar
• Lovász L., Simonovits M. On the randomized complexity of volume and diameter. Proc. 33rd IEEE FOCS (1992) Pittsburgh, PA:482–492Crossref, Google Scholar
• Lovász L., Vempala S. Fast algorithms for logconcave functions: Sampling, rounding, integration and optimization. 47th Annual IEEE Sympos. on Foundations of Comput. Sci. (FOCS '06) (2006) 57–68Crossref, Google Scholar
• Lovász L., Vempala S. The geometry of logconcave functions and sampling algorithms. Random Structures Algorithms (2006) 30(3):307–358Crossref, Google Scholar
• Lovász L., Vempala S. Hit-and-run from a corner. SIAM J. Comput. (2006) 35(4):985–1005Crossref, Google Scholar
• Lovász L., Vempala S. Simulated annealing in convex bodies and an O*(n4) volume algorithm. J. Comput. System Sci. (2006) 72:392–417Crossref, Google Scholar
• Naor A., Romik D. Projecting the surface measure of the sphere of lpn. Annales de l'Institut Henri Poincare (B), Probab. Statist. (2003) 39:241–261Crossref, Google Scholar
• Nesterov Y., Todd M., Ye Y. Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. Math. Programming (1999) 84:227–267Crossref, Google Scholar
• Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Vempala S. Geometric random walks: A survey. Combin. Comput. Geometry (2005) 52:573–612Google Scholar