MIT机电工程与计算机科学系【本科生课程】6.079.凸优化导论.Introduction.to.Convex.Optimization[www.ed2kers.com].pdfVIP

Introduction to Convex Optimization As taught in: Fall 2009 Array signal processing, with weights optimized by convex optimization. (© 2010 IEEE. Used with permission. Source: Jacob Mattingley and Stephen Boyd. Real-Time Convex Optimization in Signal Processing. IEEE Signal Processing Magazine 27, no. 3 (2010): 50-61.) Instructors: Prof. Stephen Boyd Prof. Pablo Parrilo MIT Course Number: 6.079 / 6.975 Level: Undergraduate / Graduate Course Description This course aims to give students the tools and training to recognize convex optimization problems that arise in scientific and engineering applications, presenting the basic theory, and concentrating on modeling aspects and results that are useful in applications. Topics include convex sets, convex functions, optimization problems, least-squares, linear and quadratic programs, semidefinite programming, optimality conditions, and duality theory. Applications to signal processing, control, machine learning, finance, digital and analog circuit design, computational geometry, statistics, and mechanical engineering are presented. Students complete hands-on exercises using high-level numerical software. Acknowledgements The course materials were developed jointly by Prof. Stephen Boyd (Stanford), who was a visiting professor at MIT when this course was taught, and Prof. Lieven Vanderberghe (UCLA). Syllabus Course Meeting Times Lectures: 2 sessions / week, 1.5 hours / session Recitations: 1 session / week, 1 hour / session Course Description This course aims to give students the tools and training to recognize convex optimization problems that arise in scientific and engineering applications, presenting the basic theory, and concentrating on modeling aspects and results that are useful in applications. Topics include convex sets, convex functions, optimization problems, least-squares, linear and q