A simplicial homotopy algorithm for computing zero points on polytopes

DOI10.1007/BF02006118zbMath0811.65042OpenAlexW2064434975MaRDI QIDQ1335391

Kaizhou Chen, Zaifu Yang, Zhengli Liang

Publication date: 4 October 1994

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

triangulationfixed point theoremvariable dimension algorithmoctahedral algorithmsimplicial homotopy algorithmzero points on polytopes

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Related Items (1)

A continuous deformation algorithm for variational inequality problems on polytopes

Cites Work

• The computation of fixed points and applications
• A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
• The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria
• A new subdivision for computing fixed points with a homotopy algorithm
• A class of simplicial restart fixed point algorithms without an extra dimension
• The octahedral algorithm, a new simplicial fixed point algorithm
• A new variable dimension algorithm for the fixed point problem
• Improving the convergence of fixed-point algorithms
• A restart algorithm for computing fixed points without an extra dimension
• Homotopies for computation of fixed points on unbounded regions
• Unnamed Item
• Unnamed Item

This page was built for publication: A simplicial homotopy algorithm for computing zero points on polytopes