Zobrazeno 1 - 10
of 94
pro vyhledávání: '"R. Baker Kearfott"'
Autor:
R. Baker Kearfott
Publikováno v:
Optimization Methods and Software. 24:687-708
We explain the installation and use of the GlobSol package for mathematically rigorous bounds on all solutions to constrained and unconstrained global optimization problems, as well as non-linear systems of equations. This document should be of use b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf70be6c198bf7341dff9699d25fc058
https://doi.org/10.1080/10556780802614051
https://doi.org/10.1080/10556780802614051
Autor:
R. Baker Kearfott
Publikováno v:
Computing. 82:77-102
Finding bounding sets to solutions to systems of algebraic equations with uncertainties in the coefficients, as well as rapidly but rigorously locating all solutions to nonlinear systems or global optimization problems, involves bounding the solution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e68675b449a60186ee5551830d84d66e
https://doi.org/10.1007/s00607-008-0258-2
https://doi.org/10.1007/s00607-008-0258-2
Autor:
R. Baker Kearfott
Publikováno v:
Optimization Methods and Software. 21:715-731
Both theory and implementations in deterministic global optimization have advanced significantly in the past decade. Two schools of thought have developed: the first employs various bounding techniques without validation, while the second employs dif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df232d7d5dcdc06e11d7fed269643bcb
https://doi.org/10.1080/10556780500130525
https://doi.org/10.1080/10556780500130525
Autor:
Vladik Kreinovich, R. Baker Kearfott
Publikováno v:
Journal of Global Optimization. 33:617-624
It is known that there are feasible algorithms for minimizing convex functions, and that for general functions, global minimization is a difficult (NP-hard) problem. It is reasonable to ask whether there exists a class of functions that is larger tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef1887e5b2c49c08ed2bf566da03eb30
https://doi.org/10.1007/s10898-004-2120-1
https://doi.org/10.1007/s10898-004-2120-1
Autor:
R. Baker Kearfott
Publikováno v:
Reliable Computing. 11:383-391
Many constraint propagation techniques iterate through the constraints in a straightforward manner, but can fai because they do not take account of the coupling between the constraints. However, some methods of taking account of this coupling are loc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01d1f7f6162908f88bc1bd57f0f2ed31
https://doi.org/10.1007/s11155-005-0045-0
https://doi.org/10.1007/s11155-005-0045-0
Autor:
R. Baker Kearfott, Siriporn Hongthong
Publikováno v:
SIAM Journal on Optimization. 16:418-433
Based on work originating in the early 1970s, a number of recent global optimization algorithms have relied on replacing an original nonconvex nonlinear program by convex or linear relaxations. Such linear relaxations can be generated automatically t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7cfe0ce603cb9b5e48388bdfdec987ef
https://doi.org/10.1137/030602186
https://doi.org/10.1137/030602186
Autor:
R. Baker Kearfott, Humberto Muñoz
Publikováno v:
Reliable Computing. 10:163-193
Many practical optimization problems are nonsmooth, and derivative-type methods cannot be applied. To overcome this difficulty, there are different concepts to replace the derivative of a function f : $$\mathbb{R}^n \to \mathbb{R}$$ : interval slopes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb8f65bd4ae1b29f4285c622f7ea63ec
https://doi.org/10.1023/b:reom.0000032107.85627.45
https://doi.org/10.1023/b:reom.0000032107.85627.45
Autor:
R. Baker Kearfott, V. Kreinovich
Primary Audience for the Book • Specialists in numerical computations who are interested in algorithms with automatic result verification. • Engineers, scientists, and practitioners who desire results with automatic verification and who would the
Autor:
R. Baker Kearfott
This work grew out of several years of research, graduate seminars and talks on the subject. It was motivated by a desire to make the technology accessible to those who most needed it or could most use it. It is meant to be a self-contained introduct
Autor:
Jianwei Dian, R. Baker Kearfott
Publikováno v:
SIAM Journal on Numerical Analysis. 41:2350-2373
Finding approximate solutions to systems of n nonlinear equations in n real variables is a much studied problem in numerical analysis. Somewhat more recently, researchers have developed numerical methods to provide mathematically rigorous error bound
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02743104704d7eef163f3c4b8efc4f99
https://doi.org/10.1137/s0036142901386057
https://doi.org/10.1137/s0036142901386057