Computational Experience with the Chow-yorke

Simple item page
dc.contributor.authorWatson, Layne T.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:37:17Zen
dc.date.available2013-06-19T14:37:17Zen
dc.date.issued1978en
dc.description.abstractThe 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.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000832/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000832/01/CS78010-R.pdfen
dc.identifier.trnumberCS78010-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20329en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleComputational Experience with the Chow-yorkeen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS78010-R.pdf
Size:
690.73 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports