Computer science people, I am looking to be pointed in the right direction. I am looking for a solution to a problem, and I think the answer might lie in an area of Computer Science/Statistics/O.R. that I know very little about. Here's the deal:
I have two mathematical functions, f_1 and f_2. Both functions intersect with the Y axis at exactly two
(
Read more... )
Comments 5
I don't have any idea, beyond vague notions like hill-climbing that only work if there aren't a lot of global maximums. If you want me to explain my vague notions on what hill-climbing does I can.
Reply
Reply
This sounds like a convex optimization problem, in general, but I don't know enough to be sure. Convex optimization problems are "easy."
Reply
f_1 is easy. It's just a quadratic equation. When I say it intersects the x-axis in two points, I mean that it looks like the quadratic equation in this image:
http://www.freemathhelp.com/images/lessons/graph14.gif
and I really don't care what happens to it below y=0. In fact, I'll assume x=0 whenever y<=0. So I am just trying to say that it creates an enclosed area above the x axis. Maybe that doesn't matter ( ... )
Reply
So f1 = ax^2 + bx + c. Easy enough.
f2 = m12 * (x - \beta * (x1 + \alpha)) + y1 when x1 < x <= x2,
m23 * (x - \beta * (x1 + \alpha)) + y2 when x2 < x <= x3 ( ... )
Reply
Leave a comment