A class of simplicial restart fixed point algorithms without an extra dimension
- 1 December 1981
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 20 (1), 33-48
- https://doi.org/10.1007/bf01589331
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An improvement of fixed point algorithms by using a good triangulationMathematical Programming, 1980
- A new subdivision for computing fixed points with a homotopy algorithmMathematical Programming, 1980
- A restart algorithm for computing fixed points without an extra dimensionMathematical Programming, 1979
- A restart algorithm without an artificial level for computing fixed points on unbounded regionsLecture Notes in Mathematics, 1979
- Improving the convergence of fixed-point algorithmsPublished by Springer Nature ,1978
- On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary PivotingMathematics of Operations Research, 1977
- A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational ResultsSIAM Journal on Numerical Analysis, 1976
- Sandwich method for finding fixed pointsJournal of Optimization Theory and Applications, 1975
- Homotopies for computation of fixed points on unbounded regionsMathematical Programming, 1972
- Homotopies for computation of fixed pointsMathematical Programming, 1972