The Log Barrier Method
Learn how to solve any constrained convex optimization problem using the log barrier method.
The algorithm
The log barrier method or interior point method is a general algorithm that can be used to solve optimization problems where the inequality constraints are convex and twice differentiable, such as LP, QP, and convex programming.
Consider a convex optimization problem with the
Get hands-on with 1300+ tech skills courses.