Pages that link to "Item:Q4403026"

The following pages link to Homotopies for computation of fixed points (Q4403026):

Displaying 49 items.

• Solving non-monotone equilibrium problems via a DIRECT-type approach (Q2154447) (← links)
• A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games (Q2155890) (← links)
• A differentiable path-following algorithm for computing perfect stationary points (Q2181604) (← links)
• An arbitrary starting tracing procedure for computing subgame perfect equilibria (Q2194134) (← links)
• Computing equilibria for markets with constant returns production technologies (Q2241254) (← links)
• A trading mechanism contingent on several indices (Q2275808) (← links)
• Compositional synthesis of finite abstractions for networks of systems: a small-gain approach (Q2280884) (← links)
• Multirate multicast service provisioning. II: A tâtonnement process for rate allocation (Q2460034) (← links)
• Algorithms for finding connected separators between antipodal points (Q2463880) (← links)
• Solving discrete zero point problems (Q2494512) (← links)
• Markets with endogenous uncertainty theory and policy (Q2564198) (← links)
• Computation of spatial equilibria in the Ottaviano-Tabuchi-Thisse model (Q2685454) (← links)
• Application of Canonical Duality Theory to Fixed Point Problem (Q2942469) (← links)
• Circumscribed ellipsoid algorithm for fixed-point problems (Q3015053) (← links)
• An exposition of the (linear) complementarity problem (Q3050160) (← links)
• A Framework for Controlling Sources of Inaccuracy in Gaussian Process Emulation of Deterministic Computer Experiments (Q3176230) (← links)
• On the cost of approximating all roots of a complex polynomial (Q3698169) (← links)
• Iterative algorithms for the linear complementarity problem (Q3800997) (← links)
• The Homotopy Continuation Method: Numerically Implementable Topological Procedures (Q3858967) (← links)
• A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization (Q3867585) (← links)
• An improvement of fixed point algorithms by using a good triangulation (Q3872238) (← links)
• Computational experience with the Chow—Yorke algorithm (Q3877429) (← links)
• A new subdivision for computing fixed points with a homotopy algorithm (Q3880620) (← links)
• A class of simplicial restart fixed point algorithms without an extra dimension (Q3883945) (← links)
• Scalar labelings for homotopy paths (Q3890015) (← links)
• Homeomorphisms of triangulations with applications to computing fixed points (Q3899839) (← links)
• Infinite retrogression in the Eaves—Saigal algorithm (Q3899841) (← links)
• On accelerating PL continuation algorithms by predictor—corrector methods (Q3934152) (← links)
• Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm (Q3962790) (← links)
• On triangulations for computing fixed points (Q4083225) (← links)
• A fixed point theorem including the last theorem of Poincaré (Q4104582) (← links)
• On triangulations for computing fixed points (Q4132260) (← links)
• Constructive proofs of theorems relating to:F(x) = y, with applications (Q4138023) (← links)
• A modification of todd's triangulationJ 3 (Q4166141) (← links)
• A PL homotopy for finding all the roots of a polynomial (Q4178398) (← links)
• An existence theorem for solutions tof(x) = 0 (Q4178401) (← links)
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One (Q4181898) (← links)
• Finding all solutions to polynomial systems and other systems of equations (Q4197292) (← links)
• A restart algorithm for computing fixed points without an extra dimension (Q4198344) (← links)
• Intersecting families of sets and the topology of cones in economics (Q4275676) (← links)
• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods (Q4749611) (← links)
• On the computational complexity of piecewise-linear homotopy algorithms (Q4749612) (← links)
• A note on a theorem of F. Browder (Q4772986) (← links)
• An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games (Q5087713) (← links)
• (Q5389781) (← links)
• Homotopies for computation of fixed points on unbounded regions (Q5674326) (← links)
• Computing an integer point of a class of convex sets. (Q5929418) (← links)
• Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm (Q5936075) (← links)
• Existence of balanced simplices on polytopes. (Q5953376) (← links)