On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting

DOI10.1287/moor.2.2.108zbMath0395.90082OpenAlexW2053433016MaRDI QIDQ4178805

Publication date: 1977

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2.2.108

zbMATH Keywords

algorithms convergence rate computational efficiency numerical experience complementary pivoting fixed point computation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Fixed-point and coincidence theorems (topological aspects) (54H25) Rate of convergence, degree of approximation (41A25) Fixed points and coincidences in algebraic topology (55M20) Mathematical programming (90C99)

Related Items (22)

The Homotopy Continuation Method: Numerically Implementable Topological Procedures ⋮ A PL homotopy continuation method with the use of an odd map for the artificial level ⋮ A note on computing equilibria in economies with activity analysis models of production ⋮ A globally convergent algorithm for computing fixed points of \(C^2\) maps ⋮ Numerical construction of LISS Lyapunov functions under a small-gain condition ⋮ Engineering applications of the Chow-Yorke algorithm ⋮ Iterative algorithms for the linear complementarity problem ⋮ Efficiency and implementation of simplicial zero point algorithms ⋮ Globally convergent homotopy methods: A tutorial ⋮ A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization ⋮ Exploiting structure in piecewise-linear homotopy algorithms for solving equations ⋮ Computational experience with the Chow—Yorke algorithm ⋮ A new subdivision for computing fixed points with a homotopy algorithm ⋮ A class of simplicial restart fixed point algorithms without an extra dimension ⋮ An algorithm for a piecewise linear model of trade and production with negative prices and bankruptcy ⋮ A variable-dimension simplicial algorithm for antipodal fixed-point theorems ⋮ Piecewise linear paths to minimize convex functions may not be monotonic ⋮ A restart algorithm for computing fixed points without an extra dimension ⋮ The octahedral algorithm, a new simplicial fixed point algorithm ⋮ On accelerating PL continuation algorithms by predictor—corrector methods ⋮ Model transform and local parameters. Application to instantaneous attractors ⋮ An efficient simplicial algorithm for computing a zero of a convex union of smooth functions

This page was built for publication: On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting