The octahedral algorithm, a new simplicial fixed point algorithm
- 1 December 1981
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 21 (1) , 47-69
- https://doi.org/10.1007/bf01584229
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear PathsMathematics of Operations Research, 1980
- A restart algorithm without an artificial level for computing fixed points on unbounded regionsLecture Notes in Mathematics, 1979
- Efficient Acceleration Techniques for Fixed Point AlgorithmsSIAM Journal on Numerical Analysis, 1978
- 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
- On Paths Generated by Fixed Point AlgorithmsMathematics of Operations Research, 1976
- A FAST, STABLE IMPLEMENTATION OF THE SIMPLEX METHOD USING BARTELS-GOLUB UPDATING††Research for this paper was supported by the Energy Research and Development Administration Contract AT(04-3)-326 PA #18, at Stanford University.Published by Elsevier ,1976
- The Computation of Fixed Points and ApplicationsPublished by Springer Nature ,1976
- A simplicial approximation of a solution for the nonlinear complementarity problemMathematical Programming, 1975
- Numerical Techniques in Mathematical ProgrammingPublished by Elsevier ,1970