On the Jacobian of a Function at a Zero Computed by a Fixed Point Algorithm

Published Online:https://doi.org/10.1287/moor.3.2.126

Eaves and Scarf, and independently Todd, proved that the determinant of the Jacobian of a function at a zero computed by a fixed-point algorithm was zero or had the same sign as that of the artificial function used to start the algorithm. Here we show that any matrix satisfying this sign property can be realized as the Jacobian of a function at such a computed zero.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.