Complexity analysis for certain convex programming problems
We study the complexity of a barrier method for linear-inequality constrained optimization problems where the objective function is only assumed to be analytic and convex. As a special case, we obtain the usual complexity bounds for the linear programming problem and for when the objective function is convex and quadratic. (C) 1999 Academic Press.
complexity convex programming barrier method optimization