You are here

Ralph Baker Kearfott

Ralph Baker Kearfott
Professor
Applied Mathematics

204G Maxim Doucet Hall
337-482-5270
rbk@louisiana.edu

Baker Kearfott's webpage

Ph.D. 1977 University of Utah
M.S. 1974 University of Utah
B.S. 1972 University of Utah

Prof. Kearfott's research interests are clustered in several areas. These include global optimization, software development and computer arithmetic, interval computations, and modeling associated with operations research problems. Specifically, one aspect of his work focuses on branch and bound algorithms for continuous global optimization, with an emphasis on accounting for roundoff error to obtain mathematically rigorous bounds. This work has grown out of an interest to understand nonlinear systems, including parametrized systems and singularities. In the operations research line, Prof. Kearfott has collaborated with the Center for Business Information Technology and a graduate student to develop a model, specific to Lafayette Parish, for pre-placement of post-emergency relief supplies; that project led the student and Prof. Kearfott to develop an extensive knowledge of transportation and facility location models.

Prof. Kearfott has a single-authored monograph, has co-authored two other books, and has edited three collections of work appearing as books. Among many papers, he has published various articles in the ACM Transactions on Mathematical Software, the SIAM journal on Numerical Analysis, the SIAM journal on Scientific Computing, the Journal of Global Optimization, and Optimization Methods and Software, he is on the editorial board of Optimization Letters, and he is the managing editor of Reliable Computing. He has been active in producing an IEEE standard for interval arithmetic, and he is presently chair of the IEEE Standards Association Microprocessing Standardization Committee.

Selected research publications:

  • Global optimization and singular nonlinear programs: new techniques (with Roy, Julie), Reliab. Comput., 15 (2011), 242--250.
  • Interval computations, rigour and non-rigour in deterministic continuous global optimization, Optim. Methods Softw., 26 (2011), 259--279.
  • Classical and modern numerical analysis: Theory, methods and practice (with Ackleh, Azmy S., Allen, Edward James, and Seshaiyer, Padmanabhan), Chapman & Hall/CRC Numerical Analysis and Scientific Computing. CRC Press, Boca Raton, FL, (2010).
  • GlobSol user guide,Optim. Methods Softw., 24 (2009), 687--708.
  • Guest editors' preface: issue dedicated to Professor Frank Stenger (with Bialecki, Bernard, Sikorski, Krzysztof A., and Sugihara, Masaki), J. Complexity, 25 (2009), 233--236.
  • Introduction to interval analysis (with Moore, Ramon E. and Cloud, Michael J.), Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, (2009).
  • A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems, Computing, 82 (2008), 77--102.
  • Discussion and Empirical Comparisons of Linear Relaxations and Alternate Techniques in Validated Deterministic Global Optimization, Optimization Methods and Software, 21 (2006), 715-731.
  • Validated Linear Relaxations and Preprocessing: Some Experiments (with S. Hongthong), SIAM Journal on Optimization, 16 (2005), 418-433.
    Erratum: Validated linear relaxations and preprocessing: some experiments,SIAM J. Optim., 21 (2011), 415--416.
  • Beyond Convex? Global Optimization Is Feasible Only for Convex Objective Functions: A Theorem (with V. Kreinovich), Journal of Global Optimization, 33 (2005), 617-624.