Simplicial zero-point algorithms: A unifying description
We consider the limiting paths of simplicial algorithms for finding a zero point. By rewriting the zero-point problem as a problem of finding a stationary point, the problem can be solved by generating a path of stationary points of the function restricted to an expanding convex, compact set. The limiting path of a simplicial algorithm to find a zero point is obtained by choosing this set in an appropriate way. Almost all simplicial algorithms fit in this framework. Using this framework, it can be shown very easily that Merrill's condition is sufficient for convergence of the algorithms.
- Efficiency and implementation of simplicial zero point algorithms
- Simplicial Algorithm to Find Zero Points of a Function with Special Structure on a Simplotope
- A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron
- A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex
- scientific article; zbMATH DE number 4121314
- A class of simplicial restart fixed point algorithms without an extra dimension
- A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
- A Modified Integer Labeling for Complementarity Algorithms
- A new variable dimension algorithm for the fixed point problem
- A restart algorithm for computing fixed points without an extra dimension
- A simplicial approximation of a solution for the nonlinear complementarity problem
- A unification of the existence theorems of the nonlinear complementarity problem
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
- A variable-dimension simplicial algorithm for antipodal fixed-point theorems
- An improvement of fixed point algorithms by using a good triangulation
- Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere
- Computing stationary points
- Equilibrium programming:The path following approach and dynamics
- Extension of the Generalized Complementarity Problem
- scientific article; zbMATH DE number 3862340 (Why is no real title available?)
- scientific article; zbMATH DE number 3728015 (Why is no real title available?)
- scientific article; zbMATH DE number 3728016 (Why is no real title available?)
- Interpretation of a Variable Dimension Fixed Point Algorithm with an Artificial Level
- Note on the path following approach of equilibrium programming
- On the basic theorem of complementarity
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- The octahedral algorithm, a new simplicial fixed point algorithm
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
- Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
- scientific article; zbMATH DE number 4073956 (Why is no real title available?)
- scientific article; zbMATH DE number 69503 (Why is no real title available?)
- A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex
- Efficiency and implementation of simplicial zero point algorithms
This page was built for publication: Simplicial zero-point algorithms: A unifying description
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061618)
