Computational experience with the Chow—Yorke algorithm |
| |
| Authors: | Layne T. Watson |
| |
| Affiliation: | (1) Department of Computer Science, Virginia Polytechnic Institute and State University, 24061 Blacksburg, VA, USA |
| |
| Abstract: | The Chow—Yorke algorithm is a nonsimplicial homotopy type method for computing Brouwer fixed points that is globally convergent. It is efficient and accurate for fixed point problems. L.T. Watson, T.Y. Li, and C.Y. Wang have adapted the method for zero finding problems, the nonlinear complementarity problem, and nonlinear two-point boundary value problems. Here theoretical justification is given for applying the method to some mathematical programming problems, and computational results are presented.This work was partially supported by NSF Grant MCS 7821337. |
| |
| Keywords: | Chow— Yorke Algorithm Homotopy Algorithm Globally Convergent Fixed Point Computation Nonlinear Complementarity Problem Computational Results Convex Minimization Problems Nonlinear Equations |
| 本文献已被 SpringerLink 等数据库收录！ |
|
