Skip to main content
Log in

On pairs of vectors achieving the maximal angle of a convex cone

  • Published:
Mathematical Programming Submit manuscript

Abstract

In this paper we explore the concept of antipodality relative to a closed convex cone . The problem under consideration is that of finding a pair of unit vectors in K achieving the maximal angle of the cone. We mention also a few words on the attainability of critical angles. By way of application of the general theory, we briefly discuss the problem of estimating the radius of pointedness of a cone.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aubin, J.P., Frankowska, H.: Set-Valued Analysis. Birkhauser, Boston, 1990

  2. Bank, B., Guddat, J., Klatte, D., Kummer, B., Tammer, K.: Non-Linear Parametric Optimization. Birkhauser, Basel-Boston, 1983

  3. Barker, G.P.: Theory of cones. Linear Algebra Appl. 39, 263–291 (1981)

    Article  Google Scholar 

  4. Berge, C.: Espaces Topologiques, Fonctions Multivoques. Dunod, Paris, 1966

  5. Brondsted, A.: An Introduction to Convex Polytopes. Springer-Verlag, New York, 1983

  6. Hiriart-Urruty, J.B.: Projection sur un cone convexe fermé d'un espace euclidien. Décomposition orthogonale de Moreau. Revue de Mathématiques Spéciales, 147–154 (1989)

  7. Ioffe, A.D., Tihomirov, V.M.: Theory of Extremal Problems. North-Holland, Amsterdam, 1979

  8. Iusem, A., Seeger, A.: Measuring the degree of pointedness of a closed convex cone: a metric approach. Mathematische Nachrichten, 2005, to appear

  9. Iusem, A., Seeger, A.: Computing the radius of pointedness of a convex cone. Mathematical Programming, to appear

  10. Moreau, J.J.: Décomposition orthogonale d'un espace hilbertien selon deux cones mutuellement polaires. C. R. Acad. Sci. Paris, t. 255, 238–240 (1962)

    Google Scholar 

  11. Nguyen, M.H., Soltan, V.: Lower bounds for the numbers of antipodal pairs and strictly antipodal pairs of vertices in a convex polytope. Discrete Comput. Geom. 11, 149–162 (1994)

    Google Scholar 

  12. Rockafellar, R.T.: Convex Analysis. Princeton Univ. Press, Princeton, 1970

  13. Rockafellar, R.T., Wets, R.J.: Variational Analysis. Springer-Verlag, Berlin, 1998

  14. Seeger, A.: Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions. Linear Algebra Appl. 292, 1–14 (1999)

    Article  Google Scholar 

  15. Seeger, A., Torki, M.: On eigenvalues induced by a cone constraint. Linear Algebra Appl. 372, 181–206 (2003)

    Article  Google Scholar 

  16. Ziegler, G.M.: Lectures on Polytopes. Springer-Verlag, New York, 1995

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alfredo Iusem.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Iusem, A., Seeger, A. On pairs of vectors achieving the maximal angle of a convex cone. Math. Program. 104, 501–523 (2005). https://doi.org/10.1007/s10107-005-0626-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-005-0626-z

Mathematics Subject Classification (1991)

Navigation