| G. Dahlquist and A. Bjorck, Numerical Methods, N. Anderson (trans.), Prentice Hall: Englewood Cliffs, NJ, 1974. |
....even stochastic sampling of the surface provides no guidance for the search. Instead, I have devised an algorithm that yields something very close or equal to the optimal solution for a large class of inputs. It belongs to a class of optimization techniques generally called continuation methods [6, 29]. This algorithm is similar in spirit to the algorithm described in Blake and Zisserman [4] as the graduated nonconvexity, or GNC algorithm. As used here, a continuation method embeds the objective function in a family of functions L(u; s) for which there is a single local minimum at some large ....
G. Dahlquist and A. Bjorck, Numerical Methods, N. Anderson (trans.), Prentice Hall: Englewood Cliffs, NJ, 1974.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC