@inbook{3be194cf71924aedb7b4722c21ce1680,
title = "Convex programming",
abstract = "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.",
author = "Vanderbei, {Robert J.}",
note = "Publisher Copyright: {\textcopyright} The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2020.",
year = "2020",
doi = "10.1007/978-3-030-39415-8_25",
language = "English (US)",
series = "International Series in Operations Research and Management Science",
publisher = "Springer",
pages = "433--443",
booktitle = "International Series in Operations Research and Management Science",
}