default search action
R. Baker Kearfott
Person information
- affiliation: University Louisiana at Lafayette, LA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [e2]Ralph Baker Kearfott, Ildar Z. Batyrshin, Marek Z. Reformat, Martine Ceberio, Vladik Kreinovich:
Fuzzy Techniques: Theory and Applications - Proceedings of the 2019 Joint World Congress of the International Fuzzy Systems Association and the Annual Conference of the North American Fuzzy Information Processing Society IFSA/NAFIPS'2019 (Lafayette, Louisiana, USA, June 18-21, 2019). Advances in Intelligent Systems and Computing 1000, Springer 2019, ISBN 978-3-030-21919-2 [contents] - 2018
- [c8]Ralph Baker Kearfott, Dun Liu:
A Brief Review of a Method for Bounds on Polynomial Ranges over Simplexes. NAFIPS 2018: 508-518 - 2017
- [j48]Jared T. Guilbeau, Md. Istiaq Hossain, Sam D. Karhbet, Ralph Baker Kearfott
, Temitope S. Sanusi, Lihong Zhao
A review of computation of mathematically rigorous bounds on optima of linear programs. J. Glob. Optim. 68(3): 677-683 (2017) - 2015
- [j47]Ralph Baker Kearfott:
Some observations on exclusion regions in branch and bound algorithms. J. Glob. Optim. 62(2): 229-241 (2015) - 2014
- [j46]Ralph Baker Kearfott:
On rigorous upper bounds to a global optimum. J. Glob. Optim. 59(2-3): 459-476 (2014) - [j45]Ralph Baker Kearfott, Jessie Castille, Gaurav Tyagi:
Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces. Optim. Methods Softw. 29(2): 430-441 (2014) - 2013
- [j44]Ralph Baker Kearfott, Jessie Castille, Gaurav Tyagi:
A general framework for convexity analysis in deterministic global optimization. J. Glob. Optim. 56(3): 765-785 (2013) - [j43]Ralph Baker Kearfott, Sowmya Muniswamy
On smooth reformulations and direct non-smooth computations for minimax problems. J. Glob. Optim. 57(4): 1091-1111 (2013) - [c7]Ralph Baker Kearfott:
An overview of the upcoming IEEE P-1788 working group document: Standard for interval arithmetic. IFSA/NAFIPS 2013: 460-465 - 2011
- [j42]Ralph Baker Kearfott:
Interval computations, rigour and non-rigour in deterministic continuous global optimization. Optim. Methods Softw. 26(2): 259-279 (2011) - [j41]Julie Roy, R. Baker Kearfott:
Global Optimization and Singular Nonlinear Programs: New Techniques. Reliab. Comput. 15(3): 242-250 (2011) - [j40]R. Baker Kearfott:
Erratum: Validated Linear Relaxations and Preprocessing: Some Experiments. SIAM J. Optim. 21(1): 415-416 (2011)
2000 – 2009
- 2009
- [b1]Ramon E. Moore, R. Baker Kearfott, Michael J. Cloud:
Introduction to Interval Analysis. SIAM 2009, ISBN 978-0-89871-669-6, pp. I-XI, 1-223 - [j39]Bernard Bialecki, R. Baker Kearfott, Krzysztof A. Sikorski, Masaki Sugihara:
Guest editors' preface: Issue dedicated to Professor Frank Stenger. J. Complex. 25(3): 233-236 (2009) - [j38]R. Baker Kearfott:
GlobSol user guide. Optim. Methods Softw. 24(4-5): 687-708 (2009) - [r6]R. Baker Kearfott:
Interval Analysis: Intermediate Terms. Encyclopedia of Optimization 2009: 1696-1699 - [r5]R. Baker Kearfott:
Interval Analysis: Nondifferentiable Problems. Encyclopedia of Optimization 2009: 1699-1702 - [r4]R. Baker Kearfott:
Interval Analysis: Unconstrained and Constrained Optimization. Encyclopedia of Optimization 2009: 1727-1730 - [r3]R. Baker Kearfott:
Interval Analysis: Verifying Feasibility. Encyclopedia of Optimization 2009: 1730-1733 - [r2]R. Baker Kearfott:
Interval Fixed Point Theory. Encyclopedia of Optimization 2009: 1736-1739 - [r1]R. Baker Kearfott:
Interval Newton Methods. Encyclopedia of Optimization 2009: 1763-1766 - 2008
- [j37]R. Baker Kearfott:
A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems. Computing 82(1): 77-102 (2008) - [c6]R. Baker Kearfott, John D. Pryce, Nathalie Revol:
Discussions on an Interval Arithmetic Standard at Dagstuhl Seminar 08021. Numerical Validation in Current Hardware Architectures 2008: 1-6 - [c5]George F. Corliss, R. Baker Kearfott, Nedialko S. Nedialkov, John D. Pryce, Spencer Smith:
Interval Subroutine Library Mission. Reliable Implementation of Real Number Algorithms 2008: 28-43 - [i2]John D. Pryce, George F. Corliss, R. Baker Kearfott, Nedialko S. Nedialkov, Spencer Smith:
Second Note on Basic Interval Arithmetic for IEEE754R. Numerical Validation in Current Hardware Architectures 2008 - 2007
- [j36]Ralph Baker Kearfott:
János D. Pintér, ed. (2006), Global Optimization: Scientific and Engineering Case Studies, Springer Verlag Nonconvex Optimization and its Applications series, 546 pp., ISBN 0-387-30408-8. J. Glob. Optim. 38(3): 503-505 (2007) - [j35]George F. Corliss, Christopher Foley, R. Baker Kearfott:
Formulation for Reliable Analysis of Structural Frames. Reliab. Comput. 13(2): 125-147 (2007) - 2006
- [j34]R. Baker Kearfott:
Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization. Optim. Methods Softw. 21(5): 715-731 (2006) - [i1]George F. Corliss, R. Baker Kearfott, Nedialko S. Nedialkov, John D. Pryce, Spencer Smith:
Interval Subroutine Library Mission. Reliable Implementation of Real Number Algorithms 2006 - 2005
- [j33]Vladik Kreinovich, R. Baker Kearfott:
Beyond Convex? Global Optimization is Feasible Only for Convex Objective Functions: A Theorem. J. Glob. Optim. 33(4): 617-624 (2005) - [j32]R. Baker Kearfott:
Errata and Opinion to: "An Interval Entropy Penalty Method for Nonlinear Global Optimization". Reliab. Comput. 11(2): 163-164 (2005) - [j31]R. Baker Kearfott:
Validated Constraint Solving-Practicalities, Pitfalls, and New Developments. Reliab. Comput. 11(5): 383-391 (2005) - [j30]R. Baker Kearfott, Siriporn Hongthong:
Validated Linear Relaxations and Preprocessing: Some Experiments. SIAM J. Optim. 16(2): 418-433 (2005) - 2004
- [j29]Humberto Muñoz, R. Baker Kearfott:
Slope Intervals, Generalized Gradients, Semigradients, Slant Derivatives, and Csets. Reliab. Comput. 10(3): 163-193 (2004) - [e1]René Alt, Andreas Frommer, R. Baker Kearfott, Wolfram Luther:
Numerical Software with Result Verification, International Dagstuhl Seminar, Dagstuhl Castle, Germany, January 19-24, 2003, Revised Papers. Lecture Notes in Computer Science 2991, Springer 2004, ISBN 3-540-21260-4 [contents] - 2003
- [j28]Jianwei Dian, R. Baker Kearfott:
Existence verification for singular and nonsmooth zeros of real nonlinear systems. Math. Comput. 72(242): 757-766 (2003) - [j27]R. Baker Kearfott:
COCOS'02 - A Workshop on Global Constrained Optimization and Constraint Satisfaction October 2-4, 2002, Sophia-Antipolis, France. Reliab. Comput. 9(1): 81-87 (2003) - [j26]R. Baker Kearfott, Jianwei Dian:
Existence Verification for Higher Degree Singular Zeros of Nonlinear Systems. SIAM J. Numer. Anal. 41(6): 2350-2373 (2003) - [c4]R. Baker Kearfott, Markus Neher, Shin'ichi Oishi, Fabien Rico:
Libraries, Tools, and Interactive Systems for Verified Computations Four Case Studies. Numerical Software with Result Verification 2003: 36-63 - 2002
- [j25]R. Baker Kearfott, Jianwei Dian:
Verifying Topological Indices for Higher-Order Rank Deficiencies. J. Complex. 18(2): 589-611 (2002) - [j24]R. Baker Kearfott:
On Existence and Uniqueness Verification for Non-Smooth Functions. Reliab. Comput. 8(4): 267-282 (2002) - [j23]R. Baker Kearfott, G. William Walster:
SIAM Conference on Optimization, Validated Computing 2002, and the Fields Institute Informal Working Group on Validated Optimization. Reliab. Comput. 8(5): 419-424 (2002) - [j22]R. Baker Kearfott, G. William Walster:
Symbolic Preconditioning with Taylor Models: Some Examples. Reliab. Comput. 8(6): 453-468 (2002) - [c3]R. Baker Kearfott:
GlobSol: History, Composition, and Advice on Use. COCOS 2002: 17-31 - 2001
- [j21]R. Baker Kearfott:
An Example of Singularity in Nonlinear Systems. Reliab. Comput. 7(5): 425-429 (2001) - 2000
- [j20]R. Baker Kearfott, Jianwei Dian, Arnold Neumaier
Existence Verification for Singular Zeros of Complex Nonlinear Systems. SIAM J. Numer. Anal. 38(2): 360-379 (2000) - [j19]R. Baker Kearfott, G. William Walster:
On stopping criteria in verified nonlinear systems or optimization algorithms. ACM Trans. Math. Softw. 26(3): 373-389 (2000)
1990 – 1999
- 1998
- [j18]R. Baker Kearfott:
On proving existence of feasible points in equality constrained optimization problems. Math. Program. 83: 89-100 (1998) - [j17]R. Baker Kearfott:
Kreinovich, V., Lakeyev, A., Rohn, J., and Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Reliab. Comput. 4(4): 405-409 (1998) - [c2]George F. Corliss, R. Baker Kearfott:
Rigorous Global Search: Industrial Applications. SCAN 1998: 1-16 - 1997
- [j16]R. Baker Kearfott:
Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems. SIAM J. Sci. Comput. 18(2): 574-594 (1997) - 1996
- [j15]R. Baker Kearfott:
Interval Extensions of Non-Smooth Functions for Global Optimization and Nonlinear Systems Solvers. Computing 57(2): 149-162 (1996) - [j14]R. Baker Kearfott:
Algorithm 763; INTERVAL_ARITHMETIC: A Fortran 90 Module for an Interval Data Type. ACM Trans. Math. Softw. 22(4): 385-392 (1996) - 1995
- [j13]R. Baker Kearfott, Eldar A. Musaev, Vyacheslav M. Nesterov, Alexander G. Yakovlev:
Preface. Reliab. Comput. 1(1): 3-4 (1995) - [j12]R. Baker Kearfott, Eldar A. Musaev, Vyacheslav M. Nesterov, Alexander G. Yakovlev:
Предисловне. Reliab. Comput. 1(1): 5-7 (1995) - [j11]Chenyi Hu
A general iterative sparse linear solver and its parallelization for interval Newton methods. Reliab. Comput. 1(3): 251-263 (1995) - [j10]Chenyi Hu
Optimizing INTBIS on the CRAY Y-MP. Reliab. Comput. 1(3): 265-274 (1995) - [j9]R. Baker Kearfott:
A Fortran 90 Environment for Research and Prototyping of Enclosure Algorithms for Nonlinear Equations and Global Optimization. ACM Trans. Math. Softw. 21(1): 63-78 (1995) - 1994
- [j8]Kaisheng Du, R. Baker Kearfott:
The cluster problem in multivariate global optimization. J. Glob. Optim. 5(3): 253-265 (1994) - [j7]Ralph Baker Kearfott, Milind Dawande
Algorithm 737; INTLIB: a portable Fortran 77 interval standard-function library. ACM Trans. Math. Softw. 20(4): 447-459 (1994) - 1992
- [j6]R. Baker Kearfott:
An interval branch and bound algorithm for bound constrained optimization problems. J. Glob. Optim. 2(3): 259-280 (1992) - 1991
- [j5]R. Baker Kearfott:
Decomposition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems. Computing 47(2): 169-191 (1991) - [j4]R. Baker Kearfott, Robert D. Sidman, Diana Joan Major, C. Denson Hill:
Numerical tests of a method for simulating electrical potentials on the cortical surface. IEEE Trans. Biomed. Eng. 38(3): 294-299 (1991) - [c1]Chenyi Hu, Magdy A. Bayoumi, R. Baker Kearfott, Qing Yang:
A Parallelized Algorithm for the All-Row Preconditioned Interval Newton/Generalized Bisection Method. PP 1991: 205-209 - 1990
- [j3]R. Baker Kearfott, Manuel Novoa:
Algorithm 681: INTBIS, a portable interval Newton/bisection package. ACM Trans. Math. Softw. 16(2): 152-157 (1990)
1980 – 1989
- 1988
- [j2]R. Baker Kearfott:
Corrigenda: "Some Tests of Generalized Bisection". ACM Trans. Math. Softw. 14(4): 399 (1988) - 1987
- [j1]R. Baker Kearfott:
Some tests of generalized bisection. ACM Trans. Math. Softw. 13(3): 197-220 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: