A variable-dimension simplicial algorithm for antipodal fixed-point theorems

DOI10.1080/01630568008816052zbMath0456.65024OpenAlexW2097386942MaRDI QIDQ3906317

Michael J. Todd, Alden H. Wright

Publication date: 1980

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630568008816052

zbMATH Keywords

Borsuk-Ulam theoremsimplicial homotopy methodsBorsuk's antipodal theoremvariable-dimension simplicial algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Fixed points and coincidences in algebraic topology (55M20)

Related Items

A PL homotopy continuation method with the use of an odd map for the artificial level, A constructive proof of Tucker's combinatorial lemma, 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, A class of simplicial restart fixed point algorithms without an extra dimension, Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods, Simplicial zero-point algorithms: A unifying description, A new variable dimension algorithm for the fixed point problem

Cites Work

• Unnamed Item
• A constructive proof of Tucker's combinatorial lemma
• The computation of fixed points and applications
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• Borsuk's theorem through complementary pivoting
• Orientation in Complementary Pivot 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