Solving Inequality-Constrained Convex Optimization Problems Using Barrier Methods and Primal-Dual Interior Point Methods

MATLAB implementation of barrier methods and primal-dual interior point methods for solving inequality-constrained convex optimization problems with practical code examples