| Smoothing techniques for computing Nash equilibria of sequential games S Hoda, A Gilpin, J Pena, T Sandholm Mathematics of Operations Research 35 (2), 494-512, 2010 | 196 | 2010 |
| Computing the stability number of a graph via linear and semidefinite programming J Pena, J Vera, LF Zuluaga SIAM Journal on Optimization 18 (1), 87-105, 2007 | 119 | 2007 |
| First-order algorithm with convergence for-equilibrium in two-person zero-sum games A Gilpin, J Pena, T Sandholm Mathematical programming 133 (1), 279-298, 2012 | 100 | 2012 |
| Gradient-based algorithms for finding Nash equilibria in extensive form games A Gilpin, S Hoda, J Pena, T Sandholm Internet and Network Economics: Third International Workshop, WINE 2007, San …, 2007 | 86 | 2007 |
| Understanding the geometry of infeasible perturbations of a conic linear system J Pena SIAM Journal on Optimization 10 (2), 534-550, 2000 | 75 | 2000 |
| Completely positive reformulations for polynomial optimization J Pena, JC Vera, LF Zuluaga Mathematical Programming 151, 405-431, 2015 | 69 | 2015 |
| Optimal regularized dual averaging methods for stochastic optimization X Chen, Q Lin, J Pena Advances in Neural Information Processing Systems 25, 2012 | 69 | 2012 |
| Polytope conditioning and linear convergence of the Frank–Wolfe algorithm J Pena, D Rodriguez Mathematics of Operations Research 44 (1), 1-18, 2019 | 67 | 2019 |
| Computing approximate solutions for convex conic systems of constraints J Pena, J Renegar Mathematical Programming 87, 351-383, 2000 | 66 | 2000 |
| LMI approximations for cones of positive semidefinite forms LF Zuluaga, J Vera, J Pena SIAM Journal on Optimization 16 (4), 1076-1091, 2006 | 53 | 2006 |
| New characterizations of Hoffman constants for systems of linear constraints J Pena, JC Vera, LF Zuluaga Mathematical Programming 187, 79-109, 2021 | 51 | 2021 |
| A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine F Cucker, J Peña SIAM Journal on Optimization 12 (2), 522-554, 2002 | 49 | 2002 |
| A conic programming approach to generalized Tchebycheff inequalities LF Zuluaga, JF Pena Mathematics of Operations Research 30 (2), 369-388, 2005 | 45 | 2005 |
| The condition number of a function relative to a set DH Gutman, JF Pena Mathematical Programming 188, 255-294, 2021 | 35 | 2021 |
| Static-arbitrage lower bounds on the prices of basket options via linear programming J Pena, JC Vera, LF Zuluaga Quantitative Finance 10 (8), 819-827, 2010 | 34 | 2010 |
| A deterministic rescaled perceptron algorithm J Pena, N Soheili Mathematical Programming 155, 497-510, 2016 | 33 | 2016 |
| A smooth perceptron algorithm N Soheili, J Pena SIAM Journal on Optimization 22 (2), 728-737, 2012 | 32 | 2012 |
| A unified framework for Bregman proximal methods: subgradient, gradient, and accelerated gradient schemes DH Gutman, JF Pena arXiv preprint arXiv:1812.10198, 2018 | 30* | 2018 |
| Third-order extensions of Lo’s semiparametric bound for European call options LF Zuluaga, J Peña, D Du European Journal of Operational Research 198 (2), 557-570, 2009 | 29 | 2009 |
| On the von Neumann and Frank--Wolfe algorithms with away steps J Pena, D Rodríguez, N Soheili SIAM Journal on Optimization 26 (1), 499-512, 2016 | 28 | 2016 |
Luis F. ZuluagaProfessor, Industrial and Systems Engineering Department, Lehigh UniversityVerified email at lehigh.edu