I was reading the well-known convex optimization PDF lesson by Boyd and Vandenberghe (more specifically chapter 3), and ran into a problem which I haven't been to solve.
On slide 3-20, the perspective function of a function f is defined as : $$g(x,t) = t f({x \over t})$$ assuming $$f : {\rm I\!R}^n → {\rm I\!R}$$ so that $$g : {\rm I\!R}^{n+1} → {\rm I\!R}$$ and also $${x \over t} \in dom f, t > 0$$
The slide says the perspective g of the function f is convex is f is itself convex, before naming 3 examples of functions of which convexity can be proven using this theorem. The first 2 examples seem rather straightforward to me ; however the 3rd example : $$g(x) = (c^T x + d) f ({{Ax + b} \over {c^T x + d}})$$ surprised me a bit ; the slide says this function is convex if f is convex.
It appears the $$g(x,t) = t f({x \over t})$$ function is used here : $$g(Ax + b, c^T x + d) = (c^T x + d) f ({{Ax + b} \over {c^T x + d}})$$ However, I don't quite understand why composing the g function with the function mapping x to Ax + b, and restricting the t variable to have $$t = c^T x + d$$ wouldn't break the g function's convexity ; isn't such function composition subject to the function composition rules defined in slide 3-18 (Vector Composition) ?
Any idea about what I'm missing here ? Thanks in advance for your valuable help guys !