The computation of fixed points and applications

Publication date: 1976

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

Mathematics Subject Classification ID

54C60: Set-valued maps in general topology

54C05: Continuous maps

91B60: Trade models

54H25: Fixed-point and coincidence theorems (topological aspects)

55M20: Fixed points and coincidences in algebraic topology

54-02: Research exposition (monographs, survey articles) pertaining to general topology

68W99: Algorithms in computer science

Related Items

Fixed point theorems for discontinuous functions and applications, Conjugate gradient predictor corrector method for solving large scale problems, A combined relaxation method for decomposable variational inequalities^*, Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation, Polyhedral methods for piecewise-linear functions. I: The lambda method, 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., A note on vector labelling algorithm, The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations, Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games, Computation of Leray-Schauder fixed points, Topological degree and number of Nash equilibrium points of bimatrix games, Topological degree and the Sperner lemma, 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, 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, General equilibrium models and homotopy methods, A constructive proof of Ky Fan's generalization of Tucker's lemma, 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, Triangulate flat cones on simplices, 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