Abstract
Two scalar labelings are introduced for obtaining approximate solutions to systems of nonlinear equations by simplicial approximation. Under reasonable assumptions the new scalar-labeling algorithms are shown to follow, in a limiting sense, homotopy paths which can also be tracked by piecewise linear vector labeling algorithms. Though the new algorithms eliminate the need to pivot on a system of linear equations, the question of relative computational efficiency is unresolved.
Similar content being viewed by others
References
A. Charnes, C.B. Garcia and C.E. Lemke, “Constructive proofs of theorems relating tof(x) = y with applications”,Mathematical Programming 12 (1977) 328–343.
B.C. Eaves, “Computing Kakutani fixed points”,SIAM Journal of Applied Mathematics 21 (1971) 236–244.
B.C. Eaves, “Solving piecewise linear convex equations”,Mathematical Programming Study 1 (1974) 96–119.
B.C. Eaves and R. Saigal, “Homotopies for computation of fixed points on unbounded regions”,Mathematical Programming 3 (1972) 225–237.
B.C. Eaves, “Homotopies for computation of fixed points”,Mathematical Programming 3 (1972) 1–22.
M.L. Fisher and F.J. Gould, “A simplicial algorithm for the nonlinear complementarity problem”,Mathematical Programming 6 (1974) 281–300.
M.L. Fisher, F.J. Gould and J.W. Tolle, “A new simplicial approximation algorithm with restarts: Relations between convergence and labelling”, in: S. Karamardian, ed.,Fixed points: algorithms and applications (Academic Press, 1977) pp. 41–58.
M.L. Fisher, F.J. Gould and J.W. Tolle, “A simplicial approximation algorithm for solving systems of nonlinear equations”,Instituto Nazionale Di Alta Matematica: Symposia Mathematica 19 (1976) 73–90.
C.B. Garcia, “Continuation methods for simplicial mappings”, in: S. Karamardian ed.,Fixed points: algorithms and applications (Academic Press, 1977) 149–164.
C.B. Garcia, “Computation of solutions to nonlinear equations under homotopy invariance”,Mathematics of Operations Research 2 (1977) 25–29.
F.J. Gould and J.W. Tolle, “A unified approach to complementarity in optimization”,Discrete Mathematics 7 (1974) 225–271.
F.J. Gould and J.W. Tolle, “An existence theorem for solutions tof(x) = 0”,Mathematical Programming 11 (1976) 252–262.
H.W. Kuhn, “Simplicial approximation of fixed points”,Proceedings of the National Academy of Science 61 (1968) 1238–1242.
C.E. Lemke and S.J. Grotzinger, “On generalizing Shapley's index theory to labelled pseudo manifolds”,Mathematical Programming 10 (1976) 245–262.
O.H. Merrill, “Applications and extensions of an algorithm that computes fixed points of certain upper semi-continuous point to set mappings”, Ph.D. Thesis, University of Michigan, Ann Arbor (1972).
J. Ortega and W. Rheinboldt,Iterative solutions of nonlinear equations in several variables (Academic Press, 1970).
H. Scarf,The computation of economic equilibria (Yale University Press, 1973).
H. Scarf, “The approximation of fixed points of a continuous mapping”,SIAM Journal of Applied Mathematics 15 (1967) 1328–1343.
M.J. Todd,The Computation of Fixed Points and Applications (Springer, 1976).
L.A. Wolsey, “Convergence, simplicial paths and acceleration methods for simplicial approximation algorithms for finding a zero of a system of nonlinear equations”, CORE Discussion Paper No. 7427, CORE, Université Catholique de Louvain, Belgium (1974).
Author information
Authors and Affiliations
Additional information
The work of this author was supported in part by NSF Grant No. MCS-77-15509 and by ARO Grant No. DAAG-29-78-G-0160.
The work of this author was supported in part by ONR Grant No. N00014-75-C-0495 and NSF Grant No. 81058.
Rights and permissions
About this article
Cite this article
Garcia, C.B., Gould, F.J. Scalar labelings for homotopy paths. Mathematical Programming 17, 184–197 (1979). https://doi.org/10.1007/BF01588243
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01588243