Convex programming

Robert J. Vanderbei

doi:10.1007/978-3-030-39415-8_25

Convex programming

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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.

Original language	English (US)
Title of host publication	International Series in Operations Research and Management Science
Publisher	Springer
Pages	433-443
Number of pages	11
DOIs	https://doi.org/10.1007/978-3-030-39415-8_25
State	Published - 2020

Publication series

Name	International Series in Operations Research and Management Science
Volume	285
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

Access to Document

10.1007/978-3-030-39415-8_25

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

Cite this

Vanderbei, R. J. (2020). Convex programming. In International Series in Operations Research and Management Science (pp. 433-443). (International Series in Operations Research and Management Science; Vol. 285). Springer. https://doi.org/10.1007/978-3-030-39415-8_25

@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.}",

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",

}

TY - CHAP

T1 - Convex programming

AU - Vanderbei, Robert J.

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85090022643&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85090022643&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-39415-8_25

DO - 10.1007/978-3-030-39415-8_25

M3 - Chapter

AN - SCOPUS:85090022643

T3 - International Series in Operations Research and Management Science

SP - 433

EP - 443

BT - International Series in Operations Research and Management Science

PB - Springer

ER -