Let K be a solid closed convex set in a normed space. We study the geometry of the boundary of K with the help of some multivalued maps defined on the exterior of K. Supporting cones and drops are the main tools of analysis.

Contact details are reproduced from the original publication and may be historical.

José Pedro Moreno

Departamento de Matemáticas, Facultad de Ciencias, Universidad Autónoma, Madrid 28049, Spain

josepedro.moreno@uam.es
  1. H. K. Ahn, S. W. Bae, O. Cheong, J. Gudmundsson: Aperture angle and Hausdorff approximation of convex figures, Discrete Comput. Geom. 40 (2008) 414–429.https://doi.org/10.1007/s00454-007-9039-5Google Scholar
  2. H. Attouch: Variational Convergence for Functions and Operators, Pitman, Boston (1984).Google Scholar
  3. J. P. Aubin, H. Frankowska: Set-Valued Analysis, Birkhäuser, Boston (1990).Google Scholar
  4. C. Berge: Espaces Topologiques, Fonctions Multivoques, Dunod, Paris (1966).Google Scholar
  5. P. Bose, F. Hurtado-Diaz, E. Omana-Pulido, J. Snoeyink, G. T. Toussaint: Some aperture angle optimization problems, Algorithmica 33 (2002) 411–435.https://doi.org/10.1007/s00453-001-0112-9Google Scholar
  6. B. Cornet: Regularity properties of open tangent cones, Math. Program. Stud. 30 (1987) 17–33.https://doi.org/10.1007/BFb0121152Google Scholar
  7. J. Daneš: A geometric theorem useful in nonlinear functional analysis, Boll. Unione Mat. Ital., IV. Ser. 6 (1972) 369–375.Google Scholar
  8. C. F. Dunkl, K. S. Williams: A simple norm inequality, Amer. Math. Monthly 71 (1964) 53–54.https://doi.org/10.2307/2311304Google Scholar
  9. M. Epelman, R. M. Freund: Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system, Math. Program., Ser. A 88 (2000) 451–485.https://doi.org/10.1007/s101070000136Google Scholar
  10. M. Epelman, R. M. Freund: A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems, SIAM J. Optim. 12 (2002) 627–655.https://doi.org/10.1137/S1052623400373829Google Scholar
  11. R. M. Freund: On the primal-dual geometry of level sets in linear and conic optimization, SIAM J. Optim. 13 (2003) 1004–1013.https://doi.org/10.1137/S1052623401393645Google Scholar
  12. R. M. Freund, R. M. Vera: Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm, SIAM J. Optim. 10 (1999) 155–176.https://doi.org/10.1137/S105262349732829XGoogle Scholar
  13. V. I. Gurariĭ: Openings and inclinations of subspaces of a Banach space, Teor. Funkciĭ Funkcional. Anal. i Priložen. Vyp. 1 (1965) 194–204.Google Scholar
  14. A. Iusem, A. Seeger: Axiomatization of the index of pointedness for closed convex cones, Comput. Appl. Math. 24 (2005) 245–285.https://doi.org/10.1590/S0101-82052005000200006Google Scholar
  15. A. Iusem, A. Seeger: Normality and modulability indices. Part I: convex cones in normed spaces, J. Math. Anal. Appl. 338 (2008) 365–391.https://doi.org/10.1016/j.jmaa.2007.05.030Google Scholar
  16. A. Iusem, A. Seeger: Distances between closed convex cones: old and new results, J. Convex Analysis 17 (2010), to appear.https://doi.org/10.68381/jca17064Google Scholar
  17. D. N. Kutzarova, S. Rolewicz: On drop property for convex sets, Arch. Math. 56 (1991) 501–511.https://doi.org/10.1007/BF01200096Google Scholar
  18. P. J. Laurent: Approximation et Optimisation, Hermann, Paris (1972).Google Scholar
  19. D. T. Luc, R. Wets: Outer semicontinuity of positive hull mappings with application to semi-infinite and stochastic programming, SIAM J. Optim. 19 (2008) 700–713.https://doi.org/10.1137/070687505Google Scholar
  20. J. L. Massera, J. J. Schaeffer: Linear differential equations and functional analysis. I, Math. Ann. 67 (1958) 517–573.https://doi.org/10.2307/1969871Google Scholar
  21. V. Montesinos: Drop property equals reflexivity, Stud. Math. 87 (1987) 93–100.https://doi.org/10.4064/sm-87-1-93-100Google Scholar
  22. V. Montesinos: A note on drop property of unbounded sets, Arch. Math. 57 (1991) 606–608.https://doi.org/10.1007/BF01199066Google Scholar
  23. J. P. Moreno, A. Seeger: External analysis of boundary points of convex sets: illumination and visibility, Math. Scand. 105 (2009) 265–286.https://doi.org/10.7146/math.scand.a-15118Google Scholar
  24. E. Omana-Pulido, G. T. Toussaint: Aperture angle optimization problems in three dimensions, J. Math. Model. Algorithms 1 (2002) 301–329.https://doi.org/10.1023/A:1021666512528Google Scholar
  25. J. P. Penot: A characterization of tangential regularity, Nonlinear Anal., Theory Methods Appl. 5 (1981) 625–643.https://doi.org/10.1016/0362-546X(81)90079-1Google Scholar
  26. J. P. Penot: The drop theorem, the petal theorem and Ekeland’s variational principle, Nonlinear Anal., Theory Methods Appl. 10 (1986) 813–822.https://doi.org/10.1016/0362-546X(86)90069-6Google Scholar
  27. R. T. Rockafellar, R. J. Wets: Variational Analysis, Springer, Berlin (1998).https://doi.org/10.1007/978-3-642-02431-3Google Scholar
  28. S. Rolewicz: On drop property, Stud. Math. 85 (1986) 27–35.https://doi.org/10.4064/sm-85-1-17-35Google Scholar
  29. R. Schneider: Convex Bodies: The Brunn-Minkowski Theory, Cambridge Univ. Press, Cambridge (1993).https://doi.org/10.1017/CBO9780511526282Google Scholar
  30. J. Treiman: Characterization of Clarke’s tangent and normal cones in finite and infinite dimensions, Nonlinear Anal., Theory Methods Appl. 7 (1983) 771–783.https://doi.org/10.1016/0362-546X(83)90033-0Google Scholar

J. P. Moreno, A. Seeger. “External Analysis of Boundary Points of Convex Sets: Supporting Cones and Drops.” Journal of Convex Analysis 16 (2009), No. 3&4, 939–957. https://doi.org/10.68381/jca16057