AdditionalExercisesfor ConvexOptimization

Additional Exercises for convex optimization Stephen Boyd Lieven Vandenberghe January 11, 2022. This is a collection of additional exercises, meant to supplement those found in the book convex optimization , by Stephen Boyd and Lieven Vandenberghe. These exercises were used in several courses on convex optimization , EE364a (Stanford), EE236b (UCLA), or (MIT), usually for homework, but sometimes as exam questions. Some of the exercises were originally written for the book, but were removed at some point. Many of them include a computational component using one of the software packages for convex optimization : CVXPY (Python), (Julia), CVX (Matlab), or CVXR (R). We refer to these collectively as CVX*. (Some problems have not yet been updated for all languages.)

1 Introduction 1.1 Convex optimization. Are the following statements true or false? (a) Least squares is a special case of convex optimization. (b) By and large, convex optimization problems can be solved efficiently.

Loading..

Tags:

  Optimization, Convex, Convex optimization, Convexoptimization

Information

Related search queries