Stephen P. Boyd is the Samsung Professor of Engineering, and Professor of Electrical Engineering in the Information Systems Laboratory at Stanford University. He has courtesy appointments in the Department of Management Science and Engineering and the Department of Computer Science, and is member of the Institute for Computational and Mathematical Engineering. His current research focus is on convex optimization applications in control, signal processing, machine learning, and finance.
Professor Boyd received an AB degree in Mathematics, summa cum laude, from Harvard University in 1980, and a PhD in EECS from U. C. Berkeley in 1985. In 1985 he joined the faculty of Stanford's Electrical Engineering Department. He has held visiting Professor positions at Katholieke University (Leuven), McGill University (Montreal), Ecole Polytechnique Federale (Lausanne), Tsinghua University (Beijing), Universite Paul Sabatier (Toulouse), Royal Institute of Technology (Stockholm), Kyoto University, Harbin Institute of Technology, NYU, MIT, UC Berkeley, CUHK-Shenzhen, and IMT Lucca. He holds honorary doctorates from Royal Institute of Technology (KTH), Stockholm, and Catholic University of Louvain (UCL).
Professor Boyd is the author of many research articles and three books: Convex Optimization (with Lieven Vandenberghe, 2004), Linear Matrix Inequalities in System and Control Theory (with L. El Ghaoui, E. Feron, and V. Balakrishnan, 1994), and Linear Controller Design: Limits of Performance (with Craig Barratt, 1991). His group has produced many open source tools, including CVX (with Michael Grant), CVXPY (with Steven Diamond) and Convex.jl (with Madeleine Udell and others), widely used parser-solvers for convex optimization.
Professor Boyd has received many awards and honors for his research in control systems engineering and optimization, including an ONR Young Investigator Award, a Presidential Young Investigator Award, and the AACC Donald P. Eckman Award. In 2013, he received the IEEE Control Systems Award, given for outstanding contributions to control systems engineering, science, or technology. In 2012, Michael Grant and he were given the Mathematical Optimization Society's Beale-Orchard-Hays Award, given every three years for excellence in computational mathematical programming. He is a Fellow of the IEEE, SIAM, and INFORMS, a Distinguished Lecturer of the IEEE Control Systems Society, and a member of the US National Academy of Engineering. He has been invited to deliver more than 90 plenary and keynote lectures at major conferences in control, optimization, signal processing, and machine learning.
Convex optimization has emerged as a useful tool for applications that include data analysis and model fitting, resource allocation, engineering design, network design and optimization, finance, and control and signal processing. After an overview of the mathematics, algorithms, and software frameworks for convex optimization, we turn to common themes that arise across applications, such as sparsity and relaxation.