A restart algorithm for computing fixed points without an extra dimension

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

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
The computation of fixed points and applications
The Approximation of Fixed Points of a Continuous Mapping
Sandwich method for finding fixed points
Homotopies for computation of fixed points
On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting
Homotopies for computation of fixed points on unbounded regions
Komplementaritäts- und Fixpunktalgorithmen in der mathematischen Programmierung, Spieltheorie und Ökonomie
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (43)

On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems
A variable dimension fixed point algorithm and the orientation of simplices
Multirate multicast service provisioning. II: A tâtonnement process for rate allocation
Combinatorial integer labeling theorems on finite sets with applications
Solving discrete zero point problems
A new variable dimension simplicial algorithm for computing economic equilibria on \(S^ n \times \mathbb{R}_ +^{m1}\)
On the existence and computation of an equilibrium in an economy with constant returns to scale production
A simplicial homotopy algorithm for computing zero points on polytopes
A class of simplicial restart fixed point algorithms without an extra dimension
A variant of the logistic quantal response equilibrium to select a perfect equilibrium
On accelerating PL continuation algorithms by predictor—corrector methods
An improvement of fixed point algorithms by using a good triangulation
Permutation congruent transformations of the freudenthal triangulation with minimum surface density
Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
A new variable dimension algorithm for the fixed point problem
Note on the path following approach of equilibrium programming
A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
On the stability of finding approximate fixed points by simplicial 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 a parameterized system of nonlinear equations with economic applications
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
On the existence and approximation of zeroes
Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
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
Existence of balanced simplices on polytopes.
A continuous deformation algorithm for variational inequality problems on polytopes
Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm
Solving discrete systems of nonlinear equations
A new subdivision for computing fixed points with a homotopy algorithm
A discrete multivariate mean value theorem with applications
Simplicial approximation of unemployment equilibria
Multivalued mappings
On finding large sets of rewards in two-player ETP-ESP games
Simplicial zero-point algorithms: A unifying description
A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications
Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
A better triangulation for Wright's \(2^n\)-ray algorithm
Computing an integer point of a class of convex sets.
The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria

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)