Abstract
The Chow—Yorke algorithm is a nonsimplicial homotopy type method for computing Brouwer fixed points that is globally convergent. It is efficient and accurate for fixed point problems. L.T. Watson, T.Y. Li, and C.Y. Wang have adapted the method for zero finding problems, the nonlinear complementarity problem, and nonlinear two-point boundary value problems. Here theoretical justification is given for applying the method to some mathematical programming problems, and computational results are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Albern, Ruston, and Torii, “The size of rod signals”,Journal of Physiology 206 (1970) 193–208.
P. Boggs, “The solution of nonlinear systems of equations byA-stable integration techniques”,SIAM Journal on Numerical Analysis 8 (1971) 767–785.
S.N. Chow, J. Mallet-Paret and J.A. Yorke, “Finding zeros of maps: homotopy methods that are constructive with probability one”,Mathematics of Computation 32 (1978) 887–899.
G. Dahlquist, A. Bjorck and N. Anderson,Numerical methods (Prentice-Hall, Englewood Cliffs, NJ, 1974).
B.C. Eaves, “Homotopies for the computation of fixed points”,Mathematical Programming 3 (1972) 1–22.
B.C. Eaves and R. Saigal, “Homotopies for computation of fixed points on unbounded regions”,Mathematical Programming 3 (1972) 225–237.
Y. Fathi, Private communication (August 1978).
F.J. Gould, “Recent and past developments in the simplicial approximation approach to solving nonlinear equations—a subjective view”, presented at International Symposium on Extremal Methods and Systems Analysis, University of Texas (Austin, TX, September 1977).
R.B. Kellogg, T.Y. Li and J. Yorke, “A constructive proof of the Brouwer fixed-point theorem and computational results”,SIAM Journal on Numerical Analysis 13 (1976) 473–483.
O.L. Mangasarian, “Equivalence of the complementarity problem to a system of nonlinear equations”,SIAM Journal on Applied Mathematics 31 (1976) 89–92.
O.L. Mangasarian,Nonlinear programming (McGraw-Hill, New York, 1969).
O. Merrill, “Applications and extensions of an algorithm to compute fixed points of upper semicontinuous mappings”, Doctoral Thesis, I.O.E. Department, University of Michigan (Ann Arbor, MI, 1972).
K.G. Murty, “Computational complexity of complementary pivot methods”,Mathematical Programming Study 7 (1978) 61–73.
J.M. Ortega and W.C. Rheinboldt,Interative solution of nonlinear equations in several variables (Academic Press, New York, 1970).
R. Saigal, “On the convergence rate of algorithms for solving equations that are based on methods of complementary pivoting”,Mathematics of Operations Research 2 (1977) 108–124.
H. Scarf, “The approximation of fixed points of a continuous mapping”,SIAM Journal on Applied Mathematics 15 (1967) 1328–1343.
C.Y. Wang and L.T. Watson, “Squeezing of a viscous fluid between elliptic plates”,Applied Scientific Research, to appear.
L.T. Watson, T.Y. Li and C.Y. Wang, “Fluid dynamics of the elliptic porous slider”,Journal of Applied Mechanics 45 (1978) 435–436.
L.T. Watson and W.H. Yang, “Optimal design by a homotopy method”,Applicable Analysis, to appear.
L.T. Watson, “A globally convergent algorithm for computing fixed points ofC 2 maps”,Applied Mathematics and Computation 5 (1979) 297–311.
L.T. Watson, “Solving the nonlinear complementarity problem by a homotopy method”,SIAM Journal on Control and Optimization 17 (1979) 36–46.
L.T. Watson and D. Fenner, “Chow—Yorke algorithm for fixed points or zeros ofC 2 maps”,ACM Transactions on Mathematical Software, to appear.
L.T. Watson, “An algorithm that is globally convergent with probability one for a class of nonlinear two-point boundary value problems”,SIAM Journal on Numerical Analysis 16 (1979) 394–401.
R. Saigal and M.J. Todd, “Efficient acceleration techniques for fixed point algorithms”,SIAM Journal on Numerical Analysis 15 (1978) 997–1007.
Author information
Authors and Affiliations
Additional information
This work was partially supported by NSF Grant MCS 7821337.
Rights and permissions
About this article
Cite this article
Watson, L.T. Computational experience with the Chow—Yorke algorithm. Mathematical Programming 19, 92–101 (1980). https://doi.org/10.1007/BF01581630
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581630