Sec 9.7 largely refers to multidimensional root-finding using variations of the Newton-Raphson method. But, it does not talk about 'bounded' multidimensional root-finding. Are there any general algorithms for achieving the above? Or, workable methods using which the existing subroutines can be adapted to give a root bounded by a domain? Please give references, wherever possible.