Homotopies for computation of fixed points on unbounded regions
From MaRDI portal
Publication:5674326
DOI10.1007/BF01584991zbMath0258.65060MaRDI QIDQ5674326
Romesh Saigal, B. Curtis Eaves
Publication date: 1972
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items (87)
On the cost of approximating all roots of a complex polynomial ⋮ Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm ⋮ Iterative methods for variational and complementarity problems ⋮ A continuous deformation algorithm for variational inequality problems on polytopes ⋮ A simplicial homotopy algorithm for computing zero points on polytopes ⋮ Parametric fixed point algorithms with applications to economic policy analysis ⋮ A recursive algorithm for the infinity-norm fixed point problem ⋮ On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering ⋮ Solving spline-collocation approximations to nonlinear two-point boundary-value problems by a homotopy method ⋮ A PL homotopy continuation method with the use of an odd map for the artificial level ⋮ Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One ⋮ A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games ⋮ Solving non-monotone equilibrium problems via a DIRECT-type approach ⋮ A better triangulation for Wright's \(2^n\)-ray algorithm ⋮ Solving inequality constrained optimization problems by differential homotopy continuation methods ⋮ Existence and computation of short-run equilibria in economic geography ⋮ A note on computing equilibria in economies with activity analysis models of production ⋮ A property of matrices with positive determinants ⋮ On a parameterized system of nonlinear equations with economic applications ⋮ A global Newton method to compute Nash equilibria. ⋮ Fixed points of \(C^2\) maps ⋮ A globally convergent algorithm for computing fixed points of \(C^2\) maps ⋮ A variable rate refining triangulation ⋮ A simplicial algorithm for the nonlinear complementarity problem ⋮ Bounded homotopy path approach to the solution of linear complementarity problems ⋮ A set intersection theorem and applications ⋮ Generalized variational inequalities ⋮ Simplicial approximation of unemployment equilibria ⋮ Engineering applications of the Chow-Yorke algorithm ⋮ \(\tilde K'_ 3\)- A new triangulation of \(R^ n\) ⋮ General equilibrium models and homotopy methods ⋮ On the general boundary element method ⋮ Iterative algorithms for the linear complementarity problem ⋮ On triangulations for computing fixed points ⋮ A fixed point theorem including the last theorem of Poincaré ⋮ Circumscribed ellipsoid algorithm for fixed-point problems ⋮ The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations ⋮ Computational complexity of a piecewise linear homotopy algorithm ⋮ Computing an integer point of a class of convex sets. ⋮ A unified approach to complementarity in optimization ⋮ 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 ⋮ A simplicial approximation of a solution for the nonlinear complementarity problem ⋮ Sandwich method for finding fixed points ⋮ Constructive proofs of theorems relating to:F(x) = y, with applications ⋮ Solving discrete zero point problems ⋮ Efficiency and implementation of simplicial zero point algorithms ⋮ Triangulations for the cube ⋮ Globally convergent homotopy methods: A tutorial ⋮ A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization ⋮ Comparative computer results of a new complementary pivot algorithm for solving equality and inequality constrained optimization problems ⋮ Exploiting structure in piecewise-linear homotopy algorithms for solving equations ⋮ 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 ⋮ A new subdivision for computing fixed points with a homotopy algorithm ⋮ A class of simplicial restart fixed point algorithms without an extra dimension ⋮ A continuum of solutions to variational inequality with nonlinear constraints: Existence and simplicial algorithm ⋮ 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 ⋮ Piecewise linear paths to minimize convex functions may not be monotonic ⋮ A restart algorithm for computing fixed points without an extra dimension ⋮ Some inequality techniques in handling fixed point problems on unbounded sets via homotopy methods ⋮ A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications ⋮ Multivalued mappings ⋮ Computation of all solutions to a system of polynomial equations ⋮ A new homotopy method for solving non-linear complementarity problems ⋮ 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 ⋮ General network equilibrium analysis ⋮ A fixed-point representation of the generalized complementarity problem ⋮ Piecewise linear methods for nonlinear equations and optimization ⋮ A homotopy method for solving an equation of the type \(-\Delta u=F(u)\) ⋮ A generalized complementary pivoting algorithm ⋮ A note on a theorem of F. Browder ⋮ An economic equilibrium model on a multicommodity network ⋮ \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations ⋮ Permutation congruent transformations of the freudenthal triangulation with minimum surface density
Cites Work
This page was built for publication: Homotopies for computation of fixed points on unbounded regions
