A class of simplicial restart fixed point algorithms without an extra dimension

DOI10.1007/BF01589331zbMath0441.90112OpenAlexW2064119669MaRDI QIDQ3883945

Gerard van der Laan, Adolphus J. J. Talman

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1007/bf01589331

zbMATH Keywords

triangulationlabellingcomputational experienceconvergence conditionsapproximation of fixed pointsno extra dimensionsimplicial restart fixed point algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fixed-point and coincidence theorems (topological aspects) (54H25) Mathematical programming (90C99)

Related Items (29)

A simplicial homotopy algorithm for computing zero points on polytopes ⋮ On the stability of finding approximate fixed points by simplicial methods ⋮ 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 ⋮ Computing integral solutions of complementarity problems ⋮ Solving discrete systems of nonlinear equations ⋮ On Finding Large Sets of Rewards in Two-Player ETP–ESP Games ⋮ On the existence and approximation of zeroes ⋮ A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm ⋮ Computing an integer point of a class of convex sets. ⋮ Combinatorial integer labeling theorems on finite sets with applications ⋮ $J'$: A New Triangulation of $R^n $ ⋮ Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm ⋮ Solving discrete zero point problems ⋮ Efficiency and implementation of simplicial zero point algorithms ⋮ Extended antipodal theorems ⋮ A new subdivision for computing fixed points with a homotopy algorithm ⋮ A discrete multivariate mean value theorem with applications ⋮ A simplicial approach for discrete fixed point theorems ⋮ A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices ⋮ The octahedral algorithm, a new simplicial fixed point algorithm ⋮ 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 ⋮ An efficient simplicial algorithm for computing a zero of a convex union of smooth functions ⋮ A variable dimension fixed point algorithm and the orientation of simplices ⋮ A new variable dimension algorithm for the fixed point problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sandwich method for finding fixed points
• The computation of fixed points and applications
• A linear selection algorithm for sets of elements with weights
• An improvement of fixed point algorithms by using a good triangulation
• A new subdivision for computing fixed points with a homotopy algorithm
• A variable-dimension simplicial algorithm for antipodal fixed-point theorems
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting
• Improving the convergence of fixed-point algorithms
• A restart algorithm for computing fixed points without an extra dimension
• Homotopies for computation of fixed points
• The Approximation of Fixed Points of a Continuous Mapping
• Homotopies for computation of fixed points on unbounded regions

This page was built for publication: A class of simplicial restart fixed point algorithms without an extra dimension