6 papers
Computing cone-constrained singular values of matrices
Giovanni Barbarino, Nicolas Gillis, David Sossa
This paper deals with the numerical computation of the least singular value of a rectangular matrix relative to a pair of closed convex cones , which is defined as the o…
Measuring dissimilarity between convex cones by means of max-min angles
Welington de Oliveira, Valentina Sessa, David Sossa
This work introduces a novel dissimilarity measure between two convex cones, based on the max-min angle between them. We demonstrate that this measure is closely related to the Pom…
Commutation principles for optimization problems involving strictly Schur-convex functions in Euclidean Jordan algebras
Pedro G. Massey, Noelia B. Rios, David Sossa
In this work we establish several commutation principles for optimizers of shifts of spectral functions in the context of Euclidean Jordan Algebras (EJAs). For instance, we show th…
Commutation principles for nonsmooth variational problems on Euclidean Jordan algebras
Juyoung Jeong, David Sossa
The commutation principle proved by RamÃrez, Seeger, and Sossa (SIAM J Optim 23:687-694, 2013) in the setting of Euclidean Jordan algebras says that for a Fréchet differentiable…
Some commutation principles for optimization problems over transformation groups and semi-FTvN systems
M. Seetharama Gowda, David Sossa
We introduce the concepts of commutativity relative to a transformation group and strong commutativity in the setting of a semi-FTvN system and show their appearance as optimality…
Enlarging a connected graph while keeping entropy and spectral radius: self-similarity techniques
Alberto Seeger, David Sossa
This work is about self-similar sequences of growing connected graphs. We explain how to construct such sequences and why they are important. We show for instance that all the conn…