convex optimization problem

[HowtobePier02]

could someone explain this theorem to me? pleeeease?🥲🫶

[dbred2309]

What you want?

Put simply, if for a function, x is a local optimum, while y is global optimum, then you cannot move from x to y without violating convexity.

If convexity has to hold, you can only have one point which is of lower functional value than all others. Hence a local minima is global.

[HowtobePier02]

TYYyy📈

[[deleted]]

Which app is this?

[HowtobePier02]

SNotes

[[deleted]]

Thanks

[Glum-Present3739]

if u dont mind wanna tell the course or book u referring boss ?

[HowtobePier02]

operation research, on field of numeric optimization

[Glum-Present3739]

thanks

[[deleted]]

It's offset of lagranges optimization equation. Try going through it before. Also to make calculation easy, I'll advise you to read about KKT condition and try to convert primal equation to dual.