The octahedral algorithm, a new simplicial fixed point algorithm

DOI10.1007/BF01584229zbMath0475.65029MaRDI QIDQ3930548

Alden H. Wright

Publication date: 1981

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

global convergencefixed point algorithmvariable dimension simplicial algorithmrestrart technique

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (22)

A simplicial homotopy algorithm for computing zero points on polytopes ⋮ ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems ⋮ Computing economic equilibria using benefit and surplus functions ⋮ An algorithm for the linear complementarity problem with upper and lower bounds ⋮ A better triangulation for Wright's \(2^n\)-ray algorithm ⋮ Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds ⋮ A variable rate refining triangulation ⋮ The computation of quantity-constrained equilibria by virtual taxes ⋮ Some computational methods for systems of nonlinear equations and systems of polynomial equations ⋮ A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm ⋮ $J'$: A New Triangulation of $R^n $ ⋮ Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games ⋮ Efficiency and implementation of simplicial zero point algorithms ⋮ A constructive proof of Ky Fan's coincidence theorem ⋮ A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices ⋮ Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods ⋮ On the computational complexity of piecewise-linear homotopy algorithms ⋮ A lexicographic algebraic theorem and its applications ⋮ Simplicial zero-point algorithms: A unifying description ⋮ A variable dimension fixed point algorithm and the orientation of simplices ⋮ Permutation congruent transformations of the freudenthal triangulation with minimum surface density ⋮ A new variable dimension algorithm for the fixed point problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sandwich method for finding fixed points
• The computation of fixed points and applications
• Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths
• A class of simplicial restart fixed point algorithms without an extra dimension
• A simplicial approximation of a solution for the nonlinear complementarity problem
• On Paths Generated by Fixed Point Algorithms
• On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting
• Efficient Acceleration Techniques for Fixed Point Algorithms
• Improving the convergence of fixed-point algorithms
• Iterative Solution of Nonlinear Equations in Several Variables

This page was built for publication: The octahedral algorithm, a new simplicial fixed point algorithm