Material Detail

This video was recorded at Stanford Engineering Everywhere EE364A - Convex Optimization I. If you can go down to the pad, last time we looked at linear fractional program. That's a very famous – and maybe the most famous quasi-convex problem. There are lots of variations on it, and a variation – it's a generalized linear fractional problem is this. You minimize a linear fractional function here. Now always in a linear fractional function, you have to decide which sign the denominator has, and by convention this would be positive. That technically has to be specified. ... See the whole transcript at Convex Optimization I - Lecture 06

Disciplines:

• Mathematics and Statistics  / Mathematics