In the last chapter, we saw that small modifications to the primal–dual interior-point algorithm allow it to be applied to quadratic programming problems as long as the quadratic objective function is convex. In this chapter, we shall go further and allow the objective function to be a general (smooth) convex function. In addition, we shall allow the feasible region to be any convex set given by a finite collection of convex inequalities.
- Fiacco, A., and McCormick, G. (1968). Nonlinear programming: Sequential unconstrained minimization techniques. McLean: Research Analysis Corporation. Republished in 1990 by SIAM, Philadelphia.Google Scholar
- Nesterov, Y., and Nemirovsky, A. (1993). Interior point polynomial methods in convex programming: Theory and algorithms. Philadelphia: SIAM.Google Scholar
- Vanderbei, R., and Shanno, D. (1999). http://www.sor.princeton.edu/~rvdb/ps/nonlin.pdfAn interior-point algorithm for nonconvex nonlinear programming. Computational Optimization and Applications, 13, 231–252.