Some Lower Bounds for the Complexity of Continuation Methods

The full text article is not available for purchase.

The publisher only permits individual articles to be downloaded by subscribers.

Document Type: Research Article

Affiliations: 1: LAO, Université Paul Sabatier, Toulouse Cedex 04, 31062, France 2: Department of Mathematics, City University of Hong Kong, 83 Tat Chee Avenue, Hong Kong

Publication date: December 1, 1998

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more