Homotopies for computation of fixed points

DOI10.1007/BF01584975zbMath0276.55004MaRDI QIDQ4403026

Publication date: 1972

Published in: Mathematical Programming (Search for Journal in Brave)

Linear programming (90C05) Fixed-point and coincidence theorems (topological aspects) (54H25) Fixed points and coincidences in algebraic topology (55M20)

Related Items (99)

On the cost of approximating all roots of a complex polynomial ⋮ Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm ⋮ A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities ⋮ A continuous deformation algorithm for variational inequality problems on polytopes ⋮ The Homotopy Continuation Method: Numerically Implementable Topological Procedures ⋮ A recursive algorithm for the infinity-norm fixed point problem ⋮ Conceptual machines which demonstrate the existence of Brouwer fixed points ⋮ A Framework for Controlling Sources of Inaccuracy in Gaussian Process Emulation of Deterministic Computer Experiments ⋮ On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering ⋮ On the stability of finding approximate fixed points by simplicial methods ⋮ Intersecting families of sets and the topology of cones in economics ⋮ Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One ⋮ Complexity of fixed points. I ⋮ Economic equilibrium problems in reflexive Banach spaces ⋮ 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 ⋮ Computing equilibria of GEI by relocalization on a Grassmann manifold ⋮ A better triangulation for Wright's \(2^n\)-ray algorithm ⋮ Solving inequality constrained optimization problems by differential homotopy continuation methods ⋮ Notes on computation of Kakutani fixed points ⋮ Existence and computation of short-run equilibria in economic geography ⋮ On approximation of asymmetric separators of the \(n\)-cube ⋮ General existence theorem of zero points ⋮ An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games ⋮ The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints ⋮ Application of Canonical Duality Theory to Fixed Point Problem ⋮ An adjustment process for nonconvex production economies ⋮ A differentiable path-following algorithm for computing perfect stationary points ⋮ The solution of nonlinear equations by the computation of fixed points with a modification of the Sandwich method ⋮ On a parameterized system of nonlinear equations with economic applications ⋮ An arbitrary starting tracing procedure for computing subgame perfect equilibria ⋮ Fixed points of \(C^2\) maps ⋮ A globally convergent algorithm for computing fixed points of \(C^2\) maps ⋮ Computation of spatial equilibria in the Ottaviano-Tabuchi-Thisse model ⋮ Numerical construction of LISS Lyapunov functions under a small-gain condition ⋮ Solving discrete systems of nonlinear equations ⋮ Exponential lower bounds for finding Brouwer fixed points ⋮ Fixed points for fuzzy mappings ⋮ Homotopies for computation of fixed points on unbounded regions ⋮ Engineering applications of the Chow-Yorke algorithm ⋮ On economic equilibrium type problems with applications ⋮ \(\tilde K'_ 3\)- A new triangulation of \(R^ n\) ⋮ 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 ⋮ Stability verification for monotone systems using homotopy algorithms ⋮ Iterative algorithms for the linear complementarity problem ⋮ On triangulations for computing fixed points ⋮ Multirate multicast service provisioning. II: A tâtonnement process for rate allocation ⋮ Algorithms for finding connected separators between antipodal points ⋮ Computing equilibria for markets with constant returns production technologies ⋮ A fixed point theorem including the last theorem of Poincaré ⋮ Circumscribed ellipsoid algorithm for fixed-point problems ⋮ On modeling and complete solutions to general fixpoint problems in multi-scale systems with applications ⋮ Computing equilibrium prices for a capital asset pricing model with heterogeneous beliefs and margin-requirement constraints ⋮ The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations ⋮ Computing an integer point of a class of convex sets. ⋮ Combinatorial integer labeling theorems on finite sets with applications ⋮ Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games ⋮ A two-dimensional bisection envelope algorithm for fixed points ⋮ Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm ⋮ On triangulations for computing fixed points ⋮ Sandwich method for finding fixed points ⋮ Constructive proofs of theorems relating to:F(x) = y, with applications ⋮ Solving discrete zero point problems ⋮ An exposition of the (linear) complementarity problem ⋮ A trading mechanism contingent on several indices ⋮ Existence of balanced simplices on polytopes. ⋮ Globally convergent homotopy methods: A tutorial ⋮ A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization ⋮ Compositional synthesis of finite abstractions for networks of systems: a small-gain approach ⋮ An improvement of fixed point algorithms by using a good triangulation ⋮ A modification of todd's triangulationJ 3 ⋮ Computational experience with the Chow—Yorke algorithm ⋮ Multiple-source adaptation theory and algorithms ⋮ A new subdivision for computing fixed points with a homotopy algorithm ⋮ A class of simplicial restart fixed point algorithms without an extra dimension ⋮ A PL homotopy for finding all the roots of a polynomial ⋮ An existence theorem for solutions tof(x) = 0 ⋮ Scalar labelings for homotopy paths ⋮ A discrete multivariate mean value theorem with applications ⋮ A simplicial approach for discrete fixed point theorems ⋮ Generalizations of fixed point theorems and computation ⋮ Homeomorphisms of triangulations with applications to computing fixed points ⋮ Infinite retrogression in the Eaves—Saigal algorithm ⋮ Verification of approximate opacity for switched systems: a compositional approach ⋮ Finding all solutions to polynomial systems and other systems of equations ⋮ A restart algorithm for computing fixed points without an extra dimension ⋮ Unnamed Item ⋮ A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications ⋮ Markets with endogenous uncertainty theory and policy ⋮ On accelerating PL continuation algorithms by predictor—corrector methods ⋮ Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods ⋮ On the computational complexity of piecewise-linear homotopy algorithms ⋮ Piecewise linear methods for nonlinear equations and optimization ⋮ Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications ⋮ A note on a theorem of F. Browder ⋮ Properties of the transfer functions of compartmental models. II ⋮ \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations ⋮ Gauss-Newton methods for the complementarity problem ⋮ Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria

Cites Work

This page was built for publication: Homotopies for computation of fixed points