VLDB 2026 Research / reviewers in the wild / expert
Sergio García 0001
dblp:69/6171-1 · also Sergio García Quiles
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0003-4281-6916ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Optimising portfolio diversification and dimensionalityabstractAbstract A new framework for portfolio diversification is introduced which goes beyond the classical mean-variance approach and portfolio allocation strategies such as risk parity. It is based on a novel concept called portfolio dimensionality that connects diversification to the non-Gaussianity of portfolio returns and can typically be defined in terms of the ratio of risk measures which are homogenous functions of equal degree. The latter arises naturally due to our requirement that diversification measures should be leverage invariant. We introduce this new framework and argue the benefits relative to existing measures of diversification in the literature, before addressing the question of optimizing diversification or, equivalently, dimensionality. Maximising portfolio dimensionality leads to highly non-trivial optimization problems with objective functions which are typically non-convex and potentially have multiple local optima. Two complementary global optimization algorithms are thus presented. For problems of moderate size and more akin to asset allocation problems, a deterministic Branch and Bound algorithm is developed, whereas for problems of larger size a stochastic global optimization algorithm based on Gradient Langevin Dynamics is given. We demonstrate analytically and through numerical experiments that the framework reflects the desired properties often discussed in the literature. M. Barkhagen, Sergio García 0001, Jacek Gondzio, Jörg Kalcsics, J. Kroeske, Sotirios Sabanis, A. Staal |
J. Glob. Optim. | 2 |
| 2011 | Solving Large p-Median Problems with a Radius FormulationabstractBy means of a model based on a set covering formulation, it is shown how the p-median problem can be solved with just a column generation approach that is embedded in a branch-and-bound framework based on dynamic reliability branching. This method is more than competitive in terms of computational times and size of the instances that have been optimally solved. In particular, problems of a size larger than the largest ones considered in the literature up to now are solved exactly in this paper. Sergio García 0001, Martine Labbé, Alfredo Marín 0001 |
INFORMS J. Comput. | 1 |