Cristóbal Andrés Guzmán Paredes

Ph.D. in Algorithms, Combinatorics and Optimization, Georgia Institute of Technology, 2015. .
Profesor Asistente. Departamento de Matemática.
Oficina 149.
Teléfono 23545479.
crguzmanp@mat.puc.cl
http://www.mat.uc.cl/~crguzmanp/

Áreas de Investigación

Optimización convexa, análisis de algoritmos, congestión y equilibrio en redes


Publicaciones Seleccionadas

Feldman, V., Guzmán, C., Vempala, S. 2017. Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization. In: Soda '17 Proceedings of The Twenty-Eighth Annual Acm-Siam Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics Philadelphia. 1265-1277.
Dostert, M., Guzmán, C., Oliveira Filho, F., Vallentin, F. 2017. New Upper Bounds for The Density of Translative Packings of Three-Dimensional Convex Bodies With Tetrahedral Symmetry. Discrete & Computational Geometry, 58(2):449-481.
Braun, G., Guzmán, C., Pokutta, S. 2017. Lower Bounds on The Oracle Complexity of Nonsmooth Convex Optimization Via Information Theory. Ieee Transactions on Information Theory, 63(7):4709-4724.
Guzmán, C., Nemirovski, A. 2015. on Lower Complexity Bounds for Large-Scale Smooth Convex Optimization. Journal of Complexity, 31(1):1-14.
Cominetti, R., Guzmán, C. 2014. Network Congestion Control With Markovian Multipath Routing. Mathematical Programming, 147(1):231-251.

Cursos Seleccionados

MAT1226 Algebra Lineal 2017 2'