Exponential lower bounds for finding Brouwer fixed points
Conference
·
OSTI ID:5534570
The Brouwer fixed point theorem has become a major tool for modeling economic systems during the 20th century. It was intractable to use the theorem in a computational manner until 1965 when Scarf provided the first practical algorithm for finding a fixed point of a Brouwer map. Scarf's work left open the question of worst-case complexity, although he hypothesized that his algorithm had ''typical'' behavior of polynomial time in the number of variables of the problem. Here we show that any algorithm for fixed points based on function evaluation (which includes all general purpose fixed-point algorithms) must in the worst case take a number of steps which is exponential both in the number of digits of accuracy and in the number of variables. 12 refs., 4 figs.
- Research Organization:
- California Univ., Berkeley (USA). Dept. of Mathematics; Stanford Univ., CA (USA). Dept. of Computer Science
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 5534570
- Report Number(s):
- CONF-8710212-1-Summ.; ON: DE88002864
- Country of Publication:
- United States
- Language:
- English
Similar Records
A globally and universally stable price adjustment process
Periodic forcing of a limit-cycle oscillator: Fixed points, Arnold tongues, and the global organization of bifurcations
Multiplicative equations over commuting matrices
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36126
Periodic forcing of a limit-cycle oscillator: Fixed points, Arnold tongues, and the global organization of bifurcations
Journal Article
·
Wed Nov 30 23:00:00 EST 1994
· Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics; (United States)
·
OSTI ID:6785546
Multiplicative equations over commuting matrices
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416835