The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Tricky Quadratic Optimization Problem
Replies: 14   Last Post: Mar 10, 2007 2:53 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Paul Abbott

Posts: 1,437
Registered: 12/7/04
Re: Tricky Quadratic Optimization Problem
Posted: Mar 2, 2007 3:31 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

In article <>,
"junoexpress" <> wrote:

> I am trying to optimize a function of a single variable which has a
> very simple form.
> F(x) = A*[cos(x) - r*cos(c)]^2 + B*[sin(x)-r*sin(c)]^2
> where A,B,r,c are all known constants with A,B, and r all positive.
> (I know from experience with this problem that numerically A and B
> have about the same value, r is close to 1, and x should be close to
> c).

For a close to b, the form

((a + b) (1 + r^2) + (a - b) (Cos[2x] + r^2 Cos[2c]) -
4 a r Cos[c] Cos[x] - 4 b r Sin[c] Sin[x])/2

may be useful in that (a - b) is small. If a == b, then this reduces to

b (1 + r^2 - 2 r Cos[c - x])

and if c == x, then one obtains

b (r - 1)^2

Perhaps series expansion about a == b, x == c, r == 1, would be useful?
The leading terms (dependent on the order of expansion) of this are

(r - 1)^2 (b + (a - b) Cos[c]^2) + (a - b) (r - 1)(x - c) Sin[2 c] + ...


Paul Abbott Phone: 61 8 6488 2734
School of Physics, M013 Fax: +61 8 6488 1014
The University of Western Australia (CRICOS Provider No 00126G)

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.