journal article Dec 01, 1972

Homotopies for computation of fixed points on unbounded regions

View at Publisher Save 10.1007/bf01584991
Topics

No keywords indexed for this article. Browse by subject →

References
12
[1]
C. Berge,Topological spaces (MacMillan Co., New York, 1963).
[2]
B.C. Eaves, “Computing Kakutani fixed points,”SIAM Journal of Applied Mathematics, 21 (2) (1971) 236–244. 10.1137/0121027
[3]
B.C. Eaves, “On the basic theorem of complementarity,”Mathematical Programming 1 (1) (1971) 68–75. 10.1007/bf01584073
[4]
B.C. Eaves, “Homotopies for computation of fixed points,”Mathematical Programming 3 (1972) 1–22. 10.1007/bf01584975
[5]
J. Freidenfields, “A fixed point algorithm and almost-complementary sets,” Technical Report No. 71-3, Department of Operations Research, Stanford University, April 1971. In addition, “Fixed point algorithms and almost-complementary sets,” Ph.D. dissertation, Department of Operations Research, Stanford University, August 1971.
[6]
T. Hansen, “On the approximation of a competitive equilibrium,” Ph.D. dissertation, Yale University, 1968.
[7]
H.W. Kuhn, “Some combinatorial lemmas in topology,”IBM Journal for Research Development 4 (1960) 518–524. 10.1147/rd.45.0518
[8]
H.W. Kuhn, “Simplicial approximation of fixed points,”Proceedings of the National Academy of Sciences U.S.A. 61 (1968) 1238–1242. 10.1073/pnas.61.4.1238
[9]
C.E. Lemke, “Bimatrix equilibrium points and mathematical programming,”Management Science 11 (7) (1965) 681–689. 10.1287/mnsc.11.7.681
[10]
O.H. Merrill, “Applications and extensions of an algorithm that computes fixed points of certain non-empty convex upper semi-continuous point to set mappings,” Department of Industrial Engineering, University of Michigan, Technical Report No. 71-7, September 1971.
[11]
H. Scarf, “The approximation of fixed points of a continuous mapping,”SIAM Journal of Applied Mathematics 15 (5) (1967). 10.1137/0115116
[12]
E.H. Spanier,Algebraic topology (McGraw-Hill, New York, 1966).
Cited By
165
SIAM Journal on Numerical Analysis
Metrics
165
Citations
12
References
Details
Published
Dec 01, 1972
Vol/Issue
3-3(1)
Pages
225-237
License
View
Cite This Article
B. Curtis Eaves, Romesh Saigal (1972). Homotopies for computation of fixed points on unbounded regions. Mathematical Programming, 3-3(1), 225-237. https://doi.org/10.1007/bf01584991
Related

You May Also Like

On the limited memory BFGS method for large scale optimization

Dong C. Liu, Jorge Nocedal · 1989

6,311 citations

Benchmarking optimization software with performance profiles

Elizabeth D. Dolan, Jorge J. Moré · 2002

3,487 citations

An analysis of approximations for maximizing submodular set functions—I

G. L. Nemhauser, L. A. Wolsey · 1978

2,881 citations

Smooth minimization of non-smooth functions

Yu. Nesterov · 2004

1,544 citations