About me
Name: Daniel P. Robinson
Title: Associate Professor
Affiliation: Lehigh University
Bio:
Daniel P. Robinson received his Ph.D. from the University of California at San Diego in 2007. He spent the next three years working with Nicholas I. M. Gould and Jorge Nocedal as a Postdoctoral Researcher in the Mathematical Institute at the University of Oxford and the Department of Industrial Engineering and Management Sciences at Northwestern University. In 2011 he joined the Department of Applied Mathematics and Statistics in the Whiting School of Engineering at Johns Hopkins University, and then in 2019 joined the Department of Industrial and Systems Engineering in the PC Rossin College of Engineering & Applied Science at Lehigh University. His primary research area is optimization with specific interest in the design, analysis, and implementation of efficient algorithms for large-scale convex and nonconvex problems, with particular interest in applications related to computer vision and medicine/healthcare. He is a member of the Society of Industrial and Applied Mathematics (SIAM), the SIAM Activity Group (SIAG) in Optimization, the Mathematical Optimization Society (MOS), and the Institute for Operations Research and the Management Sciences (INFORMS), in addition to being the INFORMS Vice-Chair for Nonlinear Optimization (2014-2016). Daniel has served as the cluster chair for the 2016 International Conference on Continuous Optimization (ICCOPT) in Tokyo, Japan, a Program Committee member for the 2017 AAAI Conference on Artificial Intelligence in San Francisco, California, and is co-organizing the 2022 International Conference on Continuous Optimization to be hosted at Lehigh University. He is currently an Associated Editor for the journals Computational Optimization and Applications, Optimization Methods and Software, Optimization Letters, and Mathematics of Operations Research. Finally, Daniel has been awarded the Professor Joel Dean Award for Excellence in Teaching at Johns Hopkins University in 2012 and 2018, and awarded a Best Paper Prize from Optimization Letters for his co-authored 2018 paper titled "Concise Complexity Analyses for Trust-Region Methods".
