A restart algorithm for computing fixed points without an extra dimension
From MaRDI portal
Publication:4198344
Cites work
- scientific article; zbMATH DE number 3655265 (Why is no real title available?)
- scientific article; zbMATH DE number 3700117 (Why is no real title available?)
- scientific article; zbMATH DE number 3487169 (Why is no real title available?)
- scientific article; zbMATH DE number 3422228 (Why is no real title available?)
- Homotopies for computation of fixed points
- Homotopies for computation of fixed points on unbounded regions
- 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
- Sandwich method for finding fixed points
- The Approximation of Fixed Points of a Continuous Mapping
- The computation of fixed points and applications
Cited in
(43)- On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
- Multivalued mappings
- A new subdivision for computing fixed points with a homotopy algorithm
- On a parameterized system of nonlinear equations with economic applications
- Simplicial zero-point algorithms: A unifying description
- Computing an integer point of a class of convex sets.
- An improvement of fixed point algorithms by using a good triangulation
- A continuous deformation algorithm for variational inequality problems on polytopes
- A simplicial homotopy algorithm for computing zero points on polytopes
- A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems
- A better triangulation for Wright's \(2^n\)-ray algorithm
- Solving discrete zero point problems
- A variable dimension fixed point algorithm and the orientation of simplices
- On the existence and approximation of zeroes
- 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
- A variant of the logistic quantal response equilibrium to select a perfect equilibrium
- Existence of balanced simplices on polytopes.
- A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications
- Permutation congruent transformations of the freudenthal triangulation with minimum surface density
- Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
- On accelerating PL continuation algorithms by predictor—corrector methods
- The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria
- Solving non-monotone equilibrium problems via a DIRECT-type approach
- A lexicographic algebraic theorem and its applications
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games
- The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\)
- Multirate multicast service provisioning. II: A tâtonnement process for rate allocation
- A discrete multivariate mean value theorem with applications
- A new variable dimension simplicial algorithm for computing economic equilibria on \(S^ n \times \mathbb{R}_ +^{m1}\)
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
- A new variable dimension algorithm for the fixed point problem
- Note on the path following approach of equilibrium programming
- Simplicial approximation of unemployment equilibria
- A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
- Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
- On the stability of finding approximate fixed points by simplicial methods
- On the existence and computation of an equilibrium in an economy with constant returns to scale production
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
- Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm
- Combinatorial integer labeling theorems on finite sets with applications
- Solving discrete systems of nonlinear equations
- On finding large sets of rewards in two-player ETP-ESP games
- A class of simplicial restart fixed point algorithms without an extra dimension
This page was built for publication: A restart algorithm for computing fixed points without an extra dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198344)
