Abstract
We consider methods to improve the convergence of fixed-point algorithms using complementary pivoting in triangulations. In terms of measures for triangulation introduced in an earlier paper, we obtain results suggesting that orthogonal projections of regular triangulations of R n may be preferable to the standard triangulations of an n-simplex. Two special features of the restart method are that the starting point can be controlled and that the computational work of an iteration depends on whether the new vertex lies in the artificial level or not. Refinements of the measures referred to above allow comparisons of triangulations with these features taken into account. The results suggest that it may be worthwhile to use one level of a homotopy-type triangulation in a restart method. We also propose new triangulations taking advantage of the known starting point. An approximate inverse Jacobian is an automatic by-product of the algorithms; this matrix can improve their performance considerably in a number of ways. Finally, we report some computational experience that reinforces most of our conclusions.
Key words
This research was supported by National Science Foundation Grant GK-42092, and by a CORE fellowship.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A.R. Colville, “A comparative study of nonlinear programming codes”, Tech. Rept. No. 320-2949, IBM New York Scientific Center, New York (1968).
R. Courant, Differential and integral calculus, Vol. II (Interscience, New York, 1934).
J.E. Dennis and J. Moré, “Quasi-Newton methods, motivation and theory”, SIAM Review 19 (1977) 46–89.
B.C. Eaves, “Computing Kakutani fixed points”, SIAM Journal on Applied Mathematics 21 (1971) 236–244.
B.C. Eaves, “Homotopies for 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.
O.H. Merrill, “Applications and extensions of an algorithm that computes fixed points of certain upper semi-continuous points to set mappings”, Ph.D. Dissertation, University of Michigan, East Lansing, MI (1972).
R. Saigal, “On paths generated by fixed-point algorithms”, Mathematics of Operations Research 1, 359–380.
R. Saigal, “On the convergence rate of algorithms for solving equations that are based on methods of complementary pivoting”, Mathematics of Operations Research 2, 108–124.
R. Saigal, “Investigations into the efficiency of fixed point algorithms”, in: S. Karamardian, ed., Fixed points: Algorithms and applications (Academic Press, New York, 1977).
R. Saigal, D. Solow and L. Wolsey, “A comparative study of two algorithms that compute fixed points in unbounded regions”, VIII International Symposium on Mathematical Programming, Stanford University (August, 1973).
H. Scarf, “The approximation of fixed points of a continuous mapping”, SIAM Journal on Applied Mathematics 15 (1967) 1328–1343.
H. Scarf, The computation of economic equilibria (Yale University Press, New Haven, Connecticut, 1973).
M.J. Todd, “On triangulations for computing fixed points, “tMathematical Programming 10 (1976) 322–346.
M.J. Todd, “Orientation in complementary pivot algorithms”, Mathematical of Operations Research 1 (1976) 54–66.
M.J. Todd, The computation of fixed points and applications (Springer, Berlin, 1976).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 The Mathematical Programming Society
About this chapter
Cite this chapter
Todd, M.J. (1978). Improving the convergence of fixed-point algorithms. In: Balinski, M.L., Cottle, R.W. (eds) Complementarity and Fixed Point Problems. Mathematical Programming Studies, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120788
Download citation
DOI: https://doi.org/10.1007/BFb0120788
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00787-3
Online ISBN: 978-3-642-00788-0
eBook Packages: Springer Book Archive