Computing the radius of pointedness of a convex cone

Mathematical Programming

Volumn 111, Issue 1-2, 2008, Pages 217-241

  Iusem, Alfredo ^a   Seeger, Alberto ^b  

^a IMPA   (Brazil)

^b UNIVERSITY OF AVIGNON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; HILBERT SPACES; MATHEMATICAL PROGRAMMING; SET THEORY;

CUMBERSOME TASK; HAUSDORFF METRIC; METRIC SPACE; POINTEDNESS;

CONES;

EID: 34347253617     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0069-1     Document Type: Conference Paper

References (9)

1. Freund, R., Vera, J.R.: Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm. SIAM J. Optim. 10, 155-176 (2000)
2. Hiriart-Urruty, J.B.: Projection sur un cone convexe fermé d'un espace euclidien. Décomposition orthogonale de Moreau. Rev. Math. Spec. 147-154 (1989)
3. Iusem, A., Seeger, A.: Pointedness, connectedness, and convergence results in the space of closed convex cones. J. Convex Anal. 11, 267-284 (2004)
4. Iusem, A., Seeger, A.: Measuring the degree of pointedness of a closed convex cone: a metric approach. Math. Nachrichten. 279, 599-618 (2006)
5. Iusem, A., Seeger, A.: On pairs of vectors achieving the maximal angle of a convex cone. Math. Program. 104, 501-523 (2005)
6. Iusem, A., Seeger, A.: Axiomatization of the index of pointedness of closed convex cones. Comput. Appl. Math. 24, 245-283 (2005)
7. Moreau, J.J.: Décomposition orthogonale d'un espace hilbertien selon deux cones mutuellement polaires. Comptes Rendues de l'Académie Des Sciences de Paris 255, 238-240 (1962)
8. Pẽa, J., Renegar, J.: Computing approximate solutions for conic systems of constraints. Math. Program. 87, 351-383 (2000)
9. Rockafellar, R.T., Wets, R.J.: Variational Analysis. Springer, Berlin Heidelberg New York (1998)