Recently, my friend has sent me an excessively hard inequality problem, it's
If $a,b,c\ge 0: ab+bc+ca=3$ then find the minimum $$P=\sqrt{a(2b+1)}+\sqrt{b(2c+1)}+\sqrt{c(2a+1)}.$$
I try to test some specific value.
$a=b=c=1$ then $P=3\sqrt{3}\approx 5.1962$
$a=b=\sqrt{3}; c=0$ then $P\approx 4.0967:= P_{0}$
Hence, we will prove $$\sqrt{a(2b+1)}+\sqrt{b(2c+1)}+\sqrt{c(2a+1)}\ge P_{0}.$$ After squaring both side and use the hypothesis we obtain $$a+b+c+2\sum_{cyc}\sqrt{ab(2b+1)(2c+1)}\ge P^2_{0}-6.$$ I don't know how to prove the last inequality.
Could you help me make it clear two question?
Is $P_{0}$ good enough to be the desired minimum?
Is there some popular ways for the square root cyclic inequality?
Thank you for your help. Any ideas and comments are welcome and appreciate.
Update $1$.
As Michael Rozenberg pointed out, I checked $$\sqrt{a(2b+1)}+\sqrt{b(2c+1)}+\sqrt{c(2a+1)}\ge 4.$$ Equality occurs iff $a=3;b=1;c=0$ and and its cyclic permutations.
Update $2$.
It seems that the following inequality is true.
$$\color{black}{\sqrt{ab+ka}+\sqrt{bc+kb}+\sqrt{ca+kc}\ge \sqrt{q+qk}+\sqrt{k}}$$ holds for all $a,b,c\ge 0$ satisfying $q=ab+bc+ca>1; k=\dfrac{1}{q-1}.$
Equality holds at $(a,b,c)=(q,1,0)$ and its cyclic permutations.
For $k=2,$ see also here. I hope the proof in link is useful for general cases.