For this, we come up with a new approach that yields optimal value for convex optimization problem in DbMC using logarithmic barrier followed by modified Karush–Kuhn–Tucker conditions, Newton Raphson ...