The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations

DOI10.1287/moor.16.1.148zbMath0734.90121OpenAlexW2039867343MaRDI QIDQ3363101

Chuangyin Dang

Publication date: 1991

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.16.1.148

zbMATH Keywords

triangulationdiametermeasures of efficiencyaverage directional densitysurface densityfixed points of nonlinear mappings

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mathematical programming (90C99)

Related Items (9)

A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games ⋮ A better triangulation for Wright's \(2^n\)-ray algorithm ⋮ 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 ⋮ The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations ⋮ 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 ⋮ A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications ⋮ \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations ⋮ Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria

This page was built for publication: The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations