Convex Optimization(Chinese Edition) - Softcover

Paperback. Pub Date: 2016-05-01 Pages: 564 Language: Chinese Publisher: Tsinghua University Press. Convex Optimization almost all mainstream convex optimization algorithms. It includes gradient. sub gradient method. polyhedron approximation method. neighbor method and the interior point method. These methods generally rely on the cost function and constraints of convexity (and not necessarily dependent on its differentiability). and direct or indirect contact with the duality. On the specific structure of specific issues. we give a lot of examples to demonstrate the full application of the algorithm. The contents of each chapter are as follows: The first chapter. convex optimization model overview; Chapter 2. an overview of the optimization algorithm; Section 3. sub-gradient algorithm; Chapter 4. polyhedron approximation algorithm; Chapter 5. near algorithm; Chapter 6. other...