The computation of fixed points and applications
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to general topology (54-02) Set-valued maps in general topology (54C60) Fixed-point and coincidence theorems (topological aspects) (54H25) Fixed points and coincidences in algebraic topology (55M20) Trade models (91B60) Continuous maps (54C05) Algorithms in computer science (68W99)
Cited in
(only showing first 100 items - show all)- A lower bound technique for triangulations of simplotopes
- Results on discontinuity at fixed point for a new class of \(F\)-contractive mappings
- Some NP-complete problems in quadratic and nonlinear programming
- Computing economic equilibria using benefit and surplus functions
- Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm
- General economic equilibrium and variational inequalities: Existence, uniqueness and sensitivity
- Conjugate gradient predictor corrector method for solving large scale problems
- A new subdivision for computing fixed points with a homotopy algorithm
- A simple and relatively efficient triangulation of the n-cube
- On approximation of asymmetric separators of the n-cube
- Computation of equilibria in an economy with increasing returns to scale technologies
- A path to the Arrow-Debreu competitive market equilibrium
- On parallel branch and bound frameworks for global optimization
- Some computational methods for systems of nonlinear equations and systems of polynomial equations
- Two-player envy-free multi-cake division
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
- The octahedral algorithm, a new simplicial fixed point algorithm
- Piecewise linear paths to minimize convex functions may not be monotonic
- Triangulate flat cones on simplices
- Symmetric finite volume schemes for eigenvalue problems in arbitrary dimensions
- A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications
- On finding large sets of rewards in two-player ETP-ESP games
- Computation of the Nash equilibrium selected by the tracing procedure in N-person games
- 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 note on vector labelling algorithm
- Exploiting structure in piecewise-linear homotopy algorithms for solving equations
- Using convex envelopes to solve the interactive fixed-charge linear programming problem
- The Hairy Ball problem is PPAD-complete
- Computing an integer point of a class of convex sets.
- Asymptotically efficient triangulations of the d-cube
- On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
- Globally-biased disimpl algorithm for expensive global optimization
- Intermediate value theorem for simplices for simplicial approximation of fixed points and zeros
- Borsuk's theorem through complementary pivoting
- A constructive proof of Ky Fan's generalization of Tucker's lemma
- A constructive proof of Ky Fan's coincidence theorem
- Assymptotically efficient triangulations of the d-cube∗
- The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
- Envy-free division of discrete cakes
- Combinatorial integer labeling theorems on finite sets with applications
- An overview of the emergence of weaker continuity notions, various classes of contractive mappings and related fixed point theorems
- Equilibria on a Congested Transportation Network
- Solving discrete zero point problems
- Scalar labelings for homotopy paths
- A constructive proof of a permutation-based generalization of Sperner's lemma
- Quadratically constrained quadratic programming: Some applications and a method for solution
- Computation of Leray-Schauder fixed points
- Fixed points of parking functions
- A combinatorial lemma and its applications
- The 8T-LE partition applied to the obtuse triangulations of the 3D-cube
- Piecewise linear methods for nonlinear equations and optimization
- A simplicial homotopy algorithm for computing zero points on polytopes
- A differentiable homotopy method to compute perfect equilibria
- A simplicial approach for discrete fixed point theorems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations
- Modified projection methods for solving multi-valued variational inequality without monotonicity
- Remarks on endpoints of multivalued mappings in geodesic spaces
- A class of simplicial restart fixed point algorithms without an extra dimension
- KKM-type theorems for best proximity points
- A variant of the logistic quantal response equilibrium to select a perfect equilibrium
- Subdivision of simplices relative to a cutting plane and finite concave minimization
- A restart algorithm for computing fixed points without an extra dimension
- Fast parameter estimation in loss tomography for networks of general topology
- Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation
- Exchange price equilibria and variational inequalities
- A combined relaxation method for decomposable variational inequalities*
- Understanding PPA-completeness
- Lower bounds for packing densities
- Fixed point theorems for discontinuous functions and applications
- On the existence of a continuum of constrained equilibria
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
- Best proximity problems for new types of $\mathcal{Z}$-proximal contractions with an application
- On accelerating PL continuation algorithms by predictor—corrector methods
- On the computation of multi-dimensional solution manifolds of parametrized equations
- A direct splitting method for nonsmooth variational inequalities
- Computing integral solutions of complementarity problems
- A modification of todd's triangulationJ 3
- An adjustment process for nonconvex production economies
- The transition from a Drèze equilibrium to a Walrasian equilibrium
- A remark on discontinuity at fixed point
- Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations
- Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
- Notes on computation of Kakutani fixed points
- Edge pricing of multicommodity networks for selfish users with elastic demands
- Red-green refinement of simplicial meshes in \(d\) dimensions
- A variable-dimension simplicial algorithm for antipodal fixed-point theorems
- J': A New Triangulation of R^n
- A new variable dimension algorithm for the fixed point problem
- Polyhedral methods for piecewise-linear functions. I: The lambda method
- An algorithm for computing multivariable root loci by pivoting
- General equilibrium models and homotopy methods
- Fixed points for fuzzy mappings
- On the computational complexity of piecewise-linear homotopy algorithms
- A fixed point theorem for the infinite-dimensional simplex
- On a parameterized system of nonlinear equations with economic applications
- Covering with Euclidean boxes
- Generalizations of fixed point theorems and computation
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)