On the symmetry function of a convex set

Mathematical Programming

Volumn 111, Issue 1-2, 2008, Pages 57-93

  Belloni, Alexandre ^a   Freund, Robert M ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER PROGRAMMING; COMPUTER SYSTEMS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBABILITY;

APPROXIMATION RESULTS; CONVEX GEOMETRY; CROSS-RATIO DISTANCE; FUNCTIONAL PROPERTIES;

SET THEORY;

EID: 34347268158     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0074-4     Document Type: Conference Paper

References (21)

1. Anderson, T.W.: The integral of a symmetric unimodal function. Proc. Amer. Math. Soc. 6, 170-176 (1955)
2. Ball, K.: An elementary introduction to modern convex geometry. Flavors of Geometry, MSRI Publications, Vol. 31 (1997)
3. Barnes, E.: Private communication (1998)
4. Belloni, A., Freund, R.M.: Projective pre-conditioners for improving the behavior of a homogeneous conic linear system. MIT ORC Working Paper OR-375-05 May 2005
5. Bertsimas, D., Vempala, S.: Solving convex programs by random walks. J. ACM 51(4), 540-556 (2004)
6. Bonnans, J.F., Gilbert, J.C., Lemaréchal, C., Sagastizábal, C.: Numerical Optimization: Theoretical and Practical Aspects, p. xiv+423. Universitext, Springer, Berlin Heidelbreg New York (2003)
7. Dudley, R.: Uniform Central Limit Thoerems. Cambridge University Press (2000)
8. Eaves, B.C., Freund, R.M.: Optimal scaling of balls and polyhedra. Math. Program. 23, 138-147 (1982)
9. Epelman, M., Freund, R.M.: A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems. SIAM J. Optim. 12(3), 627-655 (2002)
10. Gardner, R.J.: The Brunn-Minkowski inequality. Bull. Am. Math. Soc. 39(3), 355-405 (2002)
11. Grünbaum, B.: Partitions of mass-distributions and convex bodies by hyperplanes. Pacific J. Math. 10, 1257-1261 (1960)
12. Grünbaum, B.: Measures of symmetry for convex sets. In: Convexity, Proceedings of Symposia in Pure Mathematics vol. 7, pp. 233-270 American Mathematical Society, Providence (1963)
13. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin Heidelberg New York (1994)
14. Hammer, P.C.: The centroid of a convex body. Proc. Amer. Math. Soc. 5, 522-525 (1951)
15. John, K: Extremum problems with inequalities as subsidiary conditions. In: Studies and Essays, pp. 187-204. Presented to R. Courant on His 60th Birthday, Interscience, New York (1948)
16. Klee, V.: The critical set of convex body. Am. J. Math. 75, 178-188 (1953)
17. Lovász, L., Vempala, S.: Logconcave functions: Geometry and efficient sampling algorithms. In: Proc. of the 44th IEEE Foundations of Computer Science, Boston (2003)
18. Minkowski, H.: Allegemeine Lehzätze über konvexe Polyeder. Ges. Abh. 2, 103-121 (1911)
19. Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization. MPS-SIAM Series on Optimization (2001)
20. Roos, C., Terlaky, T., Vial, J.-P.: Theory and Algorithms for Linear Optimization: An Interior Point Approach. Wiley, New York (1997)
21. Tseng, P.: Complexity analysis of a linear complementarity algorithm based on a Lyapunov function. Math. Program. 53, 297-306 (1992)