Optimization with Python from zero to hero.png

cvxpy.tar.gz

cvxpy

Optimization theory seeks the best solution, which is pivotal for machine learning, cost-cutting in manufacturing, refining logistics, and boosting finance profits.

This course provides a detailed description of different optimization problems and the techniques used to solve them. You’ll begin with the formal definition of an optimization problem and an overview of essential mathematical tools: derivatives, gradients, and Hessian. With this knowledge, you’ll implement solutions for several optimization problems. You’ll also learn approximate metaheuristic population methods like particle swarm optimization and genetic algorithms, and solve constrained optimization problems using techniques like penalty methods and constraint simplification. Finally, you’ll solve linear programs and integer programs. 

By the end of this course, you’ll become proficient in formulating different kinds of problems as optimization problems and become skilled in the Python tools that efficiently solve these problems.

Mastering Optimization with Python

# Exercise 1: Extending binary search

We learned how to generalize gradient descent and Newton's method to deal with more variables, but what about binary search? Well, let's discover it ourselves. Adapt the binary search method we saw in the first lesson of this section to solve a problem with two variables. Then, solve the following problem:

$$
\min_{x, y} x + y \\
s.t.: x + y > 1
$$

Test what we’ve learned about optimization algorithms, SciPy, vectors, and matrices.

Introduction

Derivatives and Gradients

First Optimization Algorithms

Population Methods

Adding Constraints

Linear Constrained Optimization

Summary and Conclusion

Appendix

Exercises

Exercise 1: Extending binary search