A restart algorithm for computing fixed points without an extra dimension

DOI10.1007/BF01588226zbMath0411.90061OpenAlexW2153961011MaRDI QIDQ4198344

Gerard van der Laan, Adolphus J. J. Talman

Publication date: 1979

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

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

zbMATH Keywords

set-valued maps computational experience computation of fixed points simplicial restart algorithm triangulation, grid size, labelling, approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Set-valued maps in general topology (54C60) Fixed-point and coincidence theorems (topological aspects) (54H25)

Related Items (42)

Note on the path following approach of equilibrium programming ⋮ A continuous deformation algorithm for variational inequality problems on polytopes ⋮ A simplicial homotopy algorithm for computing zero points on polytopes ⋮ On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering ⋮ On the stability of finding approximate fixed points by simplicial methods ⋮ Solving non-monotone equilibrium problems via a DIRECT-type approach ⋮ A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games ⋮ A new variable dimension simplicial algorithm for computing economic equilibria on \(S^ n \times \mathbb{R}_ +^{m1}\) ⋮ A better triangulation for Wright's \(2^n\)-ray algorithm ⋮ A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems ⋮ On a parameterized system of nonlinear equations with economic applications ⋮ Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds ⋮ The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria ⋮ Solving discrete systems of nonlinear equations ⋮ Simplicial approximation of unemployment equilibria ⋮ A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form ⋮ Multirate multicast service provisioning. II: A tâtonnement process for rate allocation ⋮ 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 ⋮ Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm ⋮ Solving discrete zero point problems ⋮ Existence of balanced simplices on polytopes. ⋮ An improvement of fixed point algorithms by using a good triangulation ⋮ A new subdivision for computing fixed points with a homotopy algorithm ⋮ A class of simplicial restart fixed point algorithms without an extra dimension ⋮ A discrete multivariate mean value theorem with applications ⋮ A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices ⋮ A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications ⋮ Multivalued mappings ⋮ On accelerating PL continuation algorithms by predictor—corrector methods ⋮ Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods ⋮ A lexicographic algebraic theorem and its applications ⋮ The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\) ⋮ On the existence and computation of an equilibrium in an economy with constant returns to scale production ⋮ Simplicial zero-point algorithms: A unifying description ⋮ Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria ⋮ 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

This page was built for publication: A restart algorithm for computing fixed points without an extra dimension