Yinyu Ye

Yinyu Ye is a Chinese-American researcher in mathematical optimization, computer science, and applied mathematics who has made influential contributions to interior-point methods, semidefinite programming, and algorithmic foundations of convex optimization. He is a professor associated with major institutions and professional societies, and has authored textbooks used in graduate programs and courses. His work connects theory and applications across operations research, computational complexity, and engineering design.

Early life and education

Ye completed undergraduate studies at Shanghai Jiao Tong University before pursuing graduate education at Cornell University. At Cornell University he worked under advisors connected to traditions from John von Neumann-era numerical analysis and modern algorithmic development influenced by researchers associated with IBM research groups and Bell Labs-era optimization. During his formative years he interacted with scholars from Stanford University, Princeton University, Harvard University, Massachusetts Institute of Technology, and international centers such as INRIA and IBM Research. Ye’s early academic network included collaborators and contemporaries from University of California, Berkeley, University of Illinois at Urbana–Champaign, Georgia Institute of Technology, and University of Michigan.

Academic career and positions

Ye has held faculty appointments at Stanford University and has been affiliated with departments that collaborate with laboratories such as SLAC National Accelerator Laboratory and interdisciplinary centers connecting NASA-funded projects, National Science Foundation programs, and industrial partners including Microsoft Research, Google Research, and Intel. He has served on committees of societies including the Society for Industrial and Applied Mathematics, the Institute for Operations Research and the Management Sciences, and editorial boards of journals associated with SIAM Journal on Optimization, Mathematical Programming, and Operations Research Letters. Ye has participated in program committees for conferences like the ACM Symposium on Theory of Computing, the IEEE Symposium on Foundations of Computer Science, the International Congress on Industrial and Applied Mathematics, and the International Symposium on Mathematical Programming. His visiting positions and sabbaticals included collaborations at Columbia University, University of Cambridge, University of Oxford, ETH Zurich, and Tokyo Institute of Technology.

Research contributions and notable results

Ye’s research advanced practical and theoretical aspects of interior-point methods originally developed in the context of work by Karmarkar, Nash, and others, linking to polynomial-time algorithms introduced by Khachiyan and refined in frameworks connected to Cook, Nemhauser, and Schrijver. He produced complexity bounds and algorithmic techniques for linear programming, semidefinite programming, and convex quadratic programming that relate to seminal results by Stephen Boyd, Lieven Vandenberghe, and Michael Todd. Ye contributed to path-following methods and primal-dual frameworks tied to developments by Megiddo, Nesterov, Yurii Nesterov, and A. Nemirovski. His work on semidefinite relaxations and rank bounds connected to research by Shmuel Friedland, Jean-Bernard Lasserre, and Rodolphe Adamczak and influenced applications in combinatorial optimization explored by Michel Goemans, David Williamson, and R. Ravi. Ye’s studies of algorithmic stability, sensitivity, and condition measures intersect with contributions by Leslie Valiant, Noam Nisan, Richard Karp, Jack Edmonds, and Michael Sipser on complexity theory and combinatorial algorithms.

Ye developed implementations and theoretical analyses that were adopted in software environments inspired by MATLAB, CVX, SeDuMi, and frameworks used in numerical linear algebra libraries associated with LAPACK and BLAS. His interdisciplinary applications span control theory communities like IEEE Control Systems Society, signal processing groups such as IEEE Signal Processing Society, and machine learning venues exemplified by NeurIPS, ICML, and AISTATS.

Awards and honors

Ye’s recognitions include distinctions from professional organizations such as SIAM, INFORMS, and fellowship designations akin to honors granted by IEEE and national academies comparable to National Academy of Engineering or country-level academies. He has received prizes for research and teaching analogous to awards named after figures like John von Neumann, George Dantzig, and Albert W. Tucker, and invited lectureships at venues including the International Congress of Mathematicians, the ACM Turing Award Symposium-adjacent forums, and endowed chairs at institutions like Stanford University and Cornell University.

Selected publications and textbooks

Ye is author or coauthor of books and monographs used in graduate curricula, including texts on interior-point algorithms, convex optimization, and computational methods that are cited alongside works by Stephen Boyd, Lieven Vandenberghe, Vladimir Nesterov, Arkadi Nemirovski, and Roger Fletcher. His selected papers appear in journals such as Mathematical Programming, SIAM Journal on Optimization, Journal of the ACM, and conference proceedings of STOC and FOCS, and have been presented at workshops hosted by Microsoft Research, Google Research, IBM Watson Research Center, and national laboratories including Los Alamos National Laboratory and Lawrence Berkeley National Laboratory.

Category:Optimization researchers Category:Stanford University faculty Category:Cornell University alumni