Lecture Convex optimization - Chapter: Interior-point methods

Lecture Convex optimization - Chapter: Interior-point methods. In this chapter we discuss interior-point methods for solving convex optimization problems that include inequality constraints. This chapter presents the following content: Inequality constrained minimization, logarithmic barrier function and central path, barrier method, feasibility and phase I methods, complexity analysis via self-concordance, generalized inequalities.