Continuous Homotopies for the Linear Complementarity Problem
dc.contributor.author | Watson, Layne T. | en |
dc.contributor.author | Bixler, J. Patrick | en |
dc.contributor.author | Poore, Aubrey B. | en |
dc.contributor.department | Computer Science | en |
dc.date.accessioned | 2013-06-19T14:37:16Z | en |
dc.date.available | 2013-06-19T14:37:16Z | en |
dc.date.issued | 1987-05-01 | en |
dc.description.abstract | There are various formulations of the linear complementarity problem as a Kakutani fixed point problem, a constrained optimization, or a nonlinear system of equations. These formulations have remained a curiosity since not many people seriously thought that a linear combinatorial problem should be converted to a nonlinear problem. Recent advances in homotopy theory and new mathematical software capabilities such as HOMPACK indicate that continuous nonlinear formulations of linear and combinatorial problems may not be far-fetched. Several different types of continuous homotopies for the linear complementarity problem are presented and analyzed here, with some numerical results. The homotopies with the best theoretical properties (global convergence and no singularities along the zero curve) turn out to also be the best in practice. | en |
dc.format.mimetype | application/pdf | en |
dc.identifier | http://eprints.cs.vt.edu/archive/00000085/ | en |
dc.identifier.sourceurl | http://eprints.cs.vt.edu/archive/00000085/01/TR-87-38.pdf | en |
dc.identifier.trnumber | TR-87-38 | en |
dc.identifier.uri | http://hdl.handle.net/10919/20336 | en |
dc.language.iso | en | en |
dc.publisher | Department of Computer Science, Virginia Polytechnic Institute & State University | en |
dc.relation.ispartof | Historical Collection(Till Dec 2001) | en |
dc.rights | In Copyright | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.title | Continuous Homotopies for the Linear Complementarity Problem | en |
dc.type | Technical report | en |
dc.type.dcmitype | Text | en |
Files
Original bundle
1 - 1 of 1