The computation of fixed points and applications

Research exposition (monographs, survey articles) pertaining to general topology (54-02) Continuous maps (54C05) Set-valued maps in general topology (54C60) Fixed-point and coincidence theorems (topological aspects) (54H25) Fixed points and coincidences in algebraic topology (55M20) Algorithms in computer science (68W99) Trade models (91B60)

Cited in

(only showing first 100 items - show all)

Edge pricing of multicommodity networks for selfish users with elastic demands
A simplicial approach for discrete fixed point theorems
A constructive proof of Ky Fan's coincidence theorem
Generalizations of fixed point theorems and computation
Covering with Euclidean boxes
Using convex envelopes to solve the interactive fixed-charge linear programming problem
A constructive proof of a permutation-based generalization of Sperner's lemma
On the computation of multi-dimensional solution manifolds of parametrized equations
Topological degree and number of Nash equilibrium points of bimatrix games
Topological degree and the Sperner lemma
Fixed points for fuzzy mappings
State and parameter estimation for nonlinear systems
Fixed point theorems for discontinuous mapping
Adaptive quadratures over volumes
Lower bounds for packing densities
Some computational methods for systems of nonlinear equations and systems of polynomial equations
On the existence of a continuum of constrained equilibria
The transition from a Drèze equilibrium to a Walrasian equilibrium
General economic equilibrium and variational inequalities: Existence, uniqueness and sensitivity
Low diameter graph decompositions
\(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations
A continuous deformation algorithm for variational inequality problems on polytopes
A simplicial homotopy algorithm for computing zero points on polytopes
A combined relaxation method for variational inequalities with nonlinear constraints
Intersection theorems with a continuum of intersection points
Asymptotically efficient triangulations of the d-cube
Numerical continuation methods: a perspective
Piecewise linear methods for nonlinear equations and optimization
On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
On parallel branch and bound frameworks for global optimization
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
Solving variational inequality and fixed point problems by line searches and potential optimization
Consensus-halving via theorems of Borsuk-Ulam and Tucker
Subdivision of simplices relative to a cutting plane and finite concave minimization
Computing economic equilibria using benefit and surplus functions
Notes on computation of Kakutani fixed points
On a parameterized system of nonlinear equations with economic applications
General equilibrium models and homotopy methods
Intermediate value theorem for simplices for simplicial approximation of fixed points and zeros
The 8T-LE partition applied to the obtuse triangulations of the 3D-cube
On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications
An overview of the emergence of weaker continuity notions, various classes of contractive mappings and related fixed point theorems
Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
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
The topological correctness of PL approximations of isomanifolds
Modified projection methods for solving multi-valued variational inequality without monotonicity
Understanding PPA-completeness
A differentiable homotopy method to compute perfect equilibria
The Hairy Ball problem is PPAD-complete
Globally-biased disimpl algorithm for expensive global optimization
Two-player envy-free multi-cake division
Computation of equilibria in an economy with increasing returns to scale technologies
Best proximity point results for Geraghty type \(\mathcal{Z}\)-proximal contractions with an application
Computing integral solutions of complementarity problems
A path to the Arrow-Debreu competitive market equilibrium
Solving discrete zero point problems
Symmetric finite volume schemes for eigenvalue problems in arbitrary dimensions
A constructive proof of Ky Fan's generalization of Tucker's lemma
On the geometry of paths generated by PL homotopy methods
A combinatorial lemma and its applications
Remarks on endpoints of multivalued mappings in geodesic spaces
Fast parameter estimation in loss tomography for networks of general topology
A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
A remark on discontinuity at fixed point
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
J': A New Triangulation of R^n
The Middle-Cut Triangulations of the n-Cube
Assymptotically efficient triangulations of the d-cube∗
On approximation of asymmetric separators of the n-cube
General network equilibrium analysis
An algorithm for computing multivariable root loci by pivoting
An economic equilibrium model on a multicommodity network
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
A PL homotopy continuation method with the use of an odd map for the artificial level
Some NP-complete problems in quadratic and nonlinear programming
An algorithm to solve boundary value problems for differential iinclusions and applications in optimal control
A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
Exploiting structure in piecewise-linear homotopy algorithms for solving equations
A new subdivision for computing fixed points with a homotopy algorithm
A class of simplicial restart fixed point algorithms without an extra dimension
Scalar labelings for homotopy paths
Borsuk's theorem through complementary pivoting
A variable-dimension simplicial algorithm for antipodal fixed-point theorems
The octahedral algorithm, a new simplicial fixed point algorithm
On accelerating PL continuation algorithms by predictor—corrector methods
Quadratically constrained quadratic programming: Some applications and a method for solution
An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
A new variable dimension algorithm for the fixed point problem
Equilibria on a Congested Transportation Network
Triangulate flat cones on simplices
A direct splitting method for nonsmooth variational inequalities
A modification of todd's triangulationJ 3
Piecewise linear paths to minimize convex functions may not be monotonic
Finding all solutions to polynomial systems and other systems of equations
A restart algorithm for computing fixed points without an extra dimension
KKM-type theorems for best proximity points
Fixed point theorems for discontinuous functions and applications

This page was built for publication: The computation of fixed points and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1228114)