A new variable dimension algorithm for the fixed point problem
暂无分享,去创建一个
[1] E. Allgower,et al. Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations , 1980 .
[2] R. Saigal,et al. A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems , 1983, Math. Oper. Res..
[3] Gerard van der Laan,et al. A class of simplicial restart fixed point algorithms without an extra dimension , 1981, Math. Program..
[4] M. Todd. The Computation of Fixed Points and Applications , 1976 .
[5] Herbert E. Scarf,et al. The Solution of Systems of Piecewise Linear Equations , 1976, Math. Oper. Res..
[6] Masakazu Kojima,et al. Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods , 1982, Math. Program..
[7] R. Freund. Variable-dimension complexes with applications , 1980 .
[8] M. Kojima. An introduction to variable dimension algorithms for solving systems of equations , 1981 .
[9] A. Talman,et al. A restart algorithm without an artificial level for computing fixed points on unbounded regions , 1979 .
[10] M. Todd,et al. A variable-dimension simplicial algorithm for antipodal fixed-point theorems , 1980 .
[11] A. Talman,et al. Simplicial fixed point algorithms , 1981 .
[12] A. Talman. Variable dimension fixed point algorithms and triangulations , 1981 .
[13] Gerard van der Laan,et al. A restart algorithm for computing fixed points without an extra dimension , 1979, Math. Program..
[14] Alden H. Wright,et al. The octahedral algorithm, a new simplicial fixed point algorithm , 1981, Math. Program..
[15] Peter M. Reiser,et al. A Modified Integer Labeling for Complementarity Algorithms , 1981, Math. Oper. Res..
[16] Ludo van der Heyden,et al. A variable dimension algorithm for the linear complementarity problem , 1980, Math. Program..