Birna P. Kristinsdottir

Learn More
An algorithm for finding a large feasible n-dimensional interval for constrained global optimization is presented. The n-dimensional interval is iteratively enlarged about a seed point while maintaining feasibility. An interval subdivision method may be used to check feasibility of the growing box. The resultant feasible interval is constrained to lie(More)
We consider the use of a generalized interval arithmetic in algorithms for solving nonlinear equations or systems of nonlinear equations. The algorithms can involve either derivatives or slopes. The convergence rate is improved for either form. The improvement is greater if slopes, rather than derivatives, are used. However, the slope method is applicable(More)
Algorithms for finding large feasible n-dimensional intervals for constrained nonlinear optimization are presented. The n-dimensional interval is iteratively enlarged about a seed point while a checking routine maintains feasibility. Two checking routines are discussed: an interval subdivision method and a global optimization method. Both checking routines(More)
  • 1