3 ms·
When talking about "convex optimization" one nearly always means that both the function and the domain are convex.
by TTPrograms 8y ago
When talking about "convex optimization" one nearly always means that both the function and the domain are convex.
- srean 8y agoNo need to define 'convex optimization' here, that follows from the definition of a convex function: F(ax + (1-a)y) <= aF(x) + (1-a) F(y) for 0<=a<=1 and x,y in domain of F. For the inequality to be satisfied ax + (1-a)y has to be in the domain. That mean the domain is convex.