A restart algorithm for computing fixed points without an extra dimension
From MaRDI portal
Publication:4198344
DOI10.1007/BF01588226zbMath0411.90061MaRDI QIDQ4198344
Gerard van der Laan, Adolphus J. J. Talman
Publication date: 1979
Published in: Mathematical Programming (Search for Journal in Brave)
set-valued maps; computational experience; computation of fixed points; simplicial restart algorithm; triangulation, grid size, labelling, approximation
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
54C60: Set-valued maps in general topology
54H25: Fixed-point and coincidence theorems (topological aspects)
Related Items
A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices, Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods, Computing an integer point of a class of convex sets., Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm, Existence of balanced simplices on polytopes., Multivalued mappings, Combinatorial integer labeling theorems on finite sets with applications, A discrete multivariate mean value theorem with applications, Simplicial zero-point algorithms: A unifying description, Simplicial approximation of unemployment equilibria, 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, A continuous deformation algorithm for variational inequality problems on polytopes, A simplicial homotopy algorithm for computing zero points on polytopes, A better triangulation for Wright's \(2^n\)-ray algorithm, A new variable dimension simplicial algorithm for computing economic equilibria on \(S^ n \times \mathbb{R}_ +^{m1}\), Multirate multicast service provisioning. II: A tâtonnement process for rate allocation, Solving discrete zero point problems, 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 variable dimension fixed point algorithm and the orientation of simplices, Permutation congruent transformations of the freudenthal triangulation with minimum surface density, 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, 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, On accelerating PL continuation algorithms by predictor—corrector methods, A new variable dimension algorithm for the fixed point problem, Note on the path following approach of equilibrium programming, A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sandwich method for finding fixed points
- The computation of fixed points and applications
- Komplementaritäts- und Fixpunktalgorithmen in der mathematischen Programmierung, Spieltheorie und Ökonomie
- On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting
- Homotopies for computation of fixed points
- The Approximation of Fixed Points of a Continuous Mapping
- Homotopies for computation of fixed points on unbounded regions
