1 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationInternational Series in Operations Research and Management Science
Number of pages11
StatePublished - 2020

Publication series

NameInternational Series in Operations Research and Management Science
ISSN (Print)0884-8289
ISSN (Electronic)2214-7934

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications
  • Strategy and Management
  • Management Science and Operations Research
  • Applied Mathematics


Dive into the research topics of 'Convex programming'. Together they form a unique fingerprint.

Cite this