Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Fredrik Saaf"'
Publikováno v:
Frontiers in Applied Mathematics and Statistics, Vol 7 (2021)
The limited-memory Broyden–Fletcher–Goldfarb–Shanno (L-BFGS) optimization method performs very efficiently for large-scale problems. A trust region search method generally performs more efficiently and robustly than a line search method, especi
Externí odkaz:
https://doaj.org/article/9c81796ad83745648144ea01621e3b90
Autor:
Guohua Gao, Hao Lu, Kefei Wang, Sean Jost, Shakir Shaikh, Jeroen Vink, Carl Blom, Terence Wells, Fredrik Saaf
Publikováno v:
Day 3 Thu, March 30, 2023.
Selecting a set of deterministic (e.g., P10, P50 and P90) models is an important and difficult step in any uncertainty quantification workflow. In this paper, we propose to use multi-objective optimization to find a reasonable balance between often c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45a63c19e6223b331198bc8aff77d465
https://doi.org/10.2118/212242-ms
https://doi.org/10.2118/212242-ms
Publikováno v:
Day 3 Thu, March 30, 2023.
The Gauss-Newton line-search method has proven to be very efficient for least-squares problems. However, it may fail to converge when applied to real-field problems because of inaccurate gradients or singular Hessians. By contrast, the trust-region o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b2b02b1dbd40e329df96d1faf665c77
https://doi.org/10.2118/212180-ms
https://doi.org/10.2118/212180-ms
Publikováno v:
SPE Journal. 27:364-380
SummaryAlthough it is possible to apply traditional optimization algorithms to determine the Pareto front of a multiobjective optimization problem, the computational cost is extremely high when the objective function evaluation requires solving a com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48f30d55ecf237c6d54cca671d681354
https://doi.org/10.2118/203971-pa
https://doi.org/10.2118/203971-pa
Publikováno v:
SPE Journal. 27:329-348
Summary When formulating history matching within the Bayesian framework, we may quantify the uncertainty of model parameters and production forecasts using conditional realizations sampled from the posterior probability density function (PDF). It is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78fc68ea466d01449c3da683b318ddd7
https://doi.org/10.2118/204008-pa
https://doi.org/10.2118/204008-pa
Publikováno v:
Computational Geosciences. 26:847-863
Summary For highly nonlinear problems, the objective function f(x) may have multiple local optima and it is desired to locate all of them. Analytical or adjoint-based derivatives may not be available for most real optimization problems, especially, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b298227ed955d087c03e2ccc42f102f
https://doi.org/10.1007/s10596-021-10101-x
https://doi.org/10.1007/s10596-021-10101-x
Autor:
Guohua Gao, Horacio Florez, Sean Jost, Shakir Shaikh, Kefei Wang, Jeroen Vink, Carl Blom, Terence Wells, Fredrik Saaf
Publikováno v:
Day 3 Wed, October 05, 2022.
Previous implementation of distributed Gauss-Newton (DGN) optimization algorithm runs multiple optimization threads in parallel, employing a synchronous running mode (S-DGN). As a result, it waits for all simulations submitted in each iteration to co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b952ec9320e463d7da082b155c798f9
https://doi.org/10.2118/210118-ms
https://doi.org/10.2118/210118-ms
Autor:
Faruk Alpak, Guohua Gao, Horacio Florez, Steve Shi, Jeroen Vink, Carl Blom, Fredrik Saaf, Terence Wells
Publikováno v:
ECMOR 2022.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ab0b859f5adb0c089bca35b189295a5
https://doi.org/10.3997/2214-4609.202244006
https://doi.org/10.3997/2214-4609.202244006
Autor:
Chaohui Chen, Faruk O. Alpak, Yixuan Wang, Terence Wells, Fredrik Saaf, Jeroen C. Vink, Guohua Gao
Publikováno v:
Day 1 Tue, October 26, 2021.
Although it is possible to apply traditional optimization algorithms to determine the Pareto front of a multi-objective optimization problem, the computational cost is extremely high, when the objective function evaluation requires solving a complex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d75aaac754a3809ea132a069304d410a
https://doi.org/10.2118/203971-ms
https://doi.org/10.2118/203971-ms
Publikováno v:
Day 1 Tue, October 26, 2021.
When formulating history matching within the Bayesian framework, we may quantify the uncertainty of model parameters and production forecasts using conditional realizations sampled from the posterior probability density function (PDF). It is quite ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0858ffc805792ddcf8d7acb48ee46424
https://doi.org/10.2118/204008-ms
https://doi.org/10.2118/204008-ms