Consider a vector x in R_++^N. Also consider two functions, g(x):R^N->R, and a(x):R^N->R, representing the geometric and arithmetic means respectively. We also know that 0<=g(x)a(x)<=1 is always true. Is the geometric-to-arithmetic function convex or concave?

tikaj1x

tikaj1x

Answered question

2022-10-23

Consider a vector x R + + N . Also consider two functions, g ( x ) : R N R , and a ( x ) : R N R , representing the geometric and arithmetic means respectively.
We also know that 0 g ( x ) a ( x ) 1 is always true.
Is the geometric-to-arithmetic function convex or concave?

Answer & Explanation

blogpolisft

blogpolisft

Beginner2022-10-24Added 10 answers

g ( x ) / a ( x ) α g ( x ) α a ( x ) .
(This depends upon your claim that x R + + n , so a ( x ) > 0). You can even maximize the ratio by solving a sequence of convex optimization problems.
The arithmetic mean, incidentally, is both convex and concave; that is, it is affine (indeed, linear). So unlike the more general answer I gave on the other page, the constraint conversion works even if α < 0. Of course, if α < 0, it is trivially satisfied.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?