ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    On the computational complexity of piecewise-linear homotopy algorithms (1982)
    Springer
    Mathematical programming 24 (1982), S. 216-224 
    Details
    ISSN: 1436-4646
    Keywords: Piecewise-linear Homotopy Algorithms ; Computational Complexity ; Exponential Growth ; Linear Complementarity Problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We show that piecewise-linear homotopy algorithms may take a number of steps that grows exponentially with the dimension when solving a system of linear equations whose solution lies close to the starting point. Our examples are based on an example of Murty exhibiting exponential growth for Lemke's algorithm for the linear complementarity problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01585104
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...