27.06.2013 Views

Evolution and Optimum Seeking

Evolution and Optimum Seeking

Evolution and Optimum Seeking

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

82 Hill climbing Strategies<br />

McCormick <strong>and</strong> Ritter (1972, 1974)<br />

Murray (1972a,b)<br />

Murtagh (1970)<br />

Murtagh <strong>and</strong> Sargent (1970)<br />

Oi, Sayama, <strong>and</strong> Takamatsu (1973)<br />

Oren (1973)<br />

Ortega <strong>and</strong> Rheinboldt (1972)<br />

Pierson <strong>and</strong> Rajtora (1970)<br />

Powell (1969, 1970a,b,c,g, 1971, 1972a,b,c,d)<br />

Rauch (1973)<br />

Ribiere (1970)<br />

Sargent <strong>and</strong> Sebastian (1972, 1973)<br />

Shanno <strong>and</strong> Kettler (1970a,b)<br />

Spedicato (1973)<br />

Tabak (1969)<br />

Tokumaru, Adachi, <strong>and</strong> Goto (1970)<br />

Werner (1974)<br />

Wolfe (1967, 1969, 1971)<br />

Many of the di erently sophisticated strategies, e.g., the classes or families of similar<br />

methods de ned by Broyden (1970b,c) <strong>and</strong> Huang (1970), are theoretically equivalent.<br />

They generate the same conjugate directions v (k) <strong>and</strong>, with an exact line search, the same<br />

sequence x (k) of iteration points if F (x) is quadratic. Dixon (1972c) even proves this<br />

identity for more general objective functions under the condition that no term of the<br />

sequence H (k) is singular.<br />

The important nding that under certain assumptions convergence can also be achieved<br />

without line searches is attributed to Wolfe (1967). A recursion formula satisfying these<br />

conditions is as follows:<br />

H (k+1) = H (k) + B (k)<br />

where<br />

B (k) = (y(k) ; H (k) z (k) )(y (k) ; H (k) z (k) ) T<br />

(y (k) ; H (k) z (k) ) z (k)T<br />

(3.33)<br />

The formula was proposed independently by Broyden (1967), Davidon (1968, 1969), Pearson<br />

(1969), <strong>and</strong> Murtagh <strong>and</strong> Sargent (1970) (see Powell, 1970a). The correction matrix<br />

B (k) has rank one, while A (k) in Equation (3.31) is of rank two. Rank one methods, also<br />

called variance methods byDavidon, cannot guarantee that H (k) remains positive-de nite.<br />

It can also happen, even in the quadratic case, that H (k) becomes singular or B (k) increases<br />

without bound. Hence in order to make methods of this type useful in practice<br />

anumber of additional precautions must be taken (Powell, 1970a Murray, 1972c). The<br />

following compromise proposal<br />

H (k+1) = H (k) + A (k) + (k) B (k)<br />

(3.34)<br />

where the scalar parameter (k) > 0 can be freely chosen, is intended to exploit the advantages<br />

of both concepts while avoiding their disadvantages (e.g., Fletcher, 1970b). Broyden

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!