Zobrazeno 1 - 10
of 266
pro vyhledávání: '"R. Baker Kearfott"'
Autor:
Alefeld, Goetz
Publikováno v:
SIAM Review, 2011 Jun 01. 53(2), 380-381.
Externí odkaz:
https://www.jstor.org/stable/23065173
Autor:
Gavrilyuk, I. P.
Publikováno v:
Mathematics of Computation, 2010 Jan 01. 79(269), 615-616.
Externí odkaz:
https://www.jstor.org/stable/40590421
Autor:
Hansen, Eldon
Publikováno v:
SIAM Review, 1998 Mar 01. 40(1), 153-154.
Externí odkaz:
https://www.jstor.org/stable/2653010
Autor:
George J. Klir
Publikováno v:
International Journal of General Systems. 27:407-408
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d931d913d448d004ef0618f3d85e4ec
https://doi.org/10.1080/03081079908962073
https://doi.org/10.1080/03081079908962073
Autor:
Klir, George J.
Publikováno v:
International Journal of General Systems; April 1999, Vol. 27 Issue: 4-5 p407-408, 2p
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