@article {IOPORT.04135324,
    author       = {Watson, Layne T. and Haftka, Raphael T.},
    title        = {Modern homotopy methods in optimization.},
    year         = {1989},
    journal      = {Computer Methods in Applied Mechanics and Engineering},
    volume       = {74},
    number       = {3},
    issn         = {0045-7825},
    pages        = {289-305},
    publisher    = {Elsevier Science S. A.( North-Holland), Amsterdam},
    doi          = {10.1016/0045-7825(89)90053-4},
    abstract     = {Authors' summary: Probability-one homotopy methods are a class of algorithms for solving nonlinear systems of equations that are accurate, robust, and converge from an arbitrary starting point almost surely. These new techniques have been successfully applied to solve Brouwer fixed point problems, polynomial systems of equations, and discretizations of nonlinear two-point boundary value problems based on shooting, finite differences, collocation and finite elements. This paper summarizes the theory of globally convergent homotopy algorithms for unconstrained and constrained optimization, and gives some examples of actual application of homotopy techniques to engineering optimization problems.},
    reviewer     = {E.Allgower},
    identifier   = {04135324},
}