Optimization code : Solution Essays
This programming assignment asks you to implement the barrier method for convex optimization problems subject to both equality and inequality constraints (Algorithm 11.1 in the textbook). For the stopping criteria, you can use ||∇f(x)||2 ≤ , where = 0.00001. 1. (20 pts) Apply your implementation to the following optimization problem. minimize1 x1 + 1 s.t. x2 + 1 x3 x1 +x2 ≤ 2; x2 +x3 […]