Does an inverse function for
$f(x) = a⋅e^{bx} + cx + d$
exist where a, b, c, d are constants? If so, what is it?
I've tried lots of methods, but they've all failed.
What I ended up doing to approximate an inverse:
For very small (very negative) values of y, I ended up using the following function:
$x = \frac{ln(\frac{y-cx-d}{a})}{b}$
to assist in a recursive approximation by which, after seeding x with a guess, I feed the function back on itself a few times. For greater values of y, I used a similar method/function inspired by binary search algorithms. My implementations converged quickly for my purposes.
Thanks everyone who commented.
It is quite possible for a function to have an inverse but with no closed formula for the inverse.
In this case, $f(x)$ is $1-1$ if and only if $f'(x)\neq 0$ for all $x$ in the (interior of the) domain, which means if $abe^{bx}\neq -b$ has no solution, so if $\frac{-d}{ab}$ is negative.
However, combinations of $x$ and $e^x$ generally make it impossible to find a formula for the inverse function.
We can easily find a way to compute the inverse when $f$ is increasing or decreasing - just apply a binary-search algorithm to get a sequence of approximations to the inverse.