James V. Burke is a Professor of Mathematics at the University of Washington with extensive contributions to optimization theory and its applications. His academic career spans several decades, during which he has developed fundamental theories in nonsmooth and convex optimization, variational analysis, and computational methods for complex optimization problems. Research Focus Burke's primary research centers on convex-composite optimization , where he has established critical theoretical foundations and practical algorithms. His work on weak sharp minima has become foundational in optimization theory, providing essential insights into solution stability and error bounds. He has made significant advances in gradient sampling algorithms for nonsmooth, nonconvex optimization problems, which have broad applications in engineering and data science. More recently, Burke has applied optimization techniques to state estimation problems , particularly developing robust Kalman smoothing methods using Student's t-distributions and other non-Gaussian models. His research bridges pure mathematical theory with practical computational methods, demonstrating consistent innovation across multiple subfields of optimization. Academic Contributions Burke has taught numerous graduate-level courses including Math 509 (Optimal Control), Math 554 (Linear Analysis), and specialized courses on convex analysis and optimization. His research collaborations span multiple institutions, with frequent co-authorship with leading optimization researchers such as Tim Hoheisel, Adrian Lewis, and Michael Overton. He regularly presents his work at major conferences including SIAM Optimization and ICCOPT, with his most recent presentation at the SIAM Conference on Optimization in Seattle (June 2023).
