==================================================================
The gateway between this list and the sci.stat.edu newsgroup will
be disabled on June 9. This list will be discontinued on June 21.
Subscribe to the new list EDSTAT-L at Penn State using the web
interface at http://lists.psu.edu/archives/edstat-l.html.
==================================================================
.
In article <[EMAIL PROTECTED]>,
[EMAIL PROTECTED] (ZHANG Yan) wrote:
> Suppose that d is positive integer, i.e. d=1,2,3...
>
> A function is defined as follows.
>
> C(d)=C1(d)+C2(d)
>
> Now, I have to proof that there exists an optimal d, see d_{op},
> leading to minimum C(d). And also I have to find an algorithm to find
> d_{op}.
>
>
> I am able to proof that C1(d) is decreasing function of d, and C2(d)
> is increasing function of d. Note that no closed-form expression for
> C1(d) or C2(d), or even has closed-form, its first and second
> derivative is extremely difficult to obtain.
>
> Could you plz give some suggestions to proceed? Many thanks in
> advance.
Since functions defined only for integer arguments cannot in any way
have derivatives, I can see that derivatives might be very difficult to
obtain.
What are the ranges of your functions? Can they have arbitrary real
values or are they restricted to, say, integer values, or even positive
integer values?
I suspect that if the values can be arbitrary reals, or even arbitrary
integers, subject only to the monotonicity requirements, that desired
the conclusion may be false.
Are C1 and C2 weakly or strictly monotone, or does it matter?
