O'Reilly logo

Convex Optimization by Lieven Vandenberghe, Stephen Boyd

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 9

Unconstrained minimization

9.1 Unconstrained minimization problems

In this chapter we discuss methods for solving the unconstrained optimization problem

(9.1)

where f : Rn R is convex and twice continuously differentiable (which implies that dom f is open). We will assume that the problem is solvable, i.e., there exists an optimal point x. (More precisely, the assumptions later in the chapter will imply that x exists and is unique.) ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required