Kathleen Schmidt

Kathleen Schmidt

Auto-generated profile, based on publicly available information

Kathleen Schmidt

Computational Engineering Division, Lawrence Livermore National Laboratory Livermore California

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 July 2019 in Statistical Analysis and Data Mining: An ASA Data Science Journal
Verified
Journal Article
Closed access
PDF file
KSKathleen Schmidt
Kathleen Schmidt
RSRalph C. Smith
Ralph C. Smith
JHJason Hite
Jason Hite
JMJohn Mattingly
John Mattingly
YAYousry Azmy
Yousry Azmy
RGRyan Goldhahn
Ryan Goldhahn

6 February 2017 in International Journal for Numerical Methods in Engineering
Verified
Journal Article
Open access
PDF file
RSRazvan Stefanescu
Razvan Stefanescu
KSKathleen Schmidt
Kathleen Schmidt
JHJason Hite
Jason Hite
RSRalph C Smith
Ralph C Smith
JMJohn Mattingly
John Mattingly
We propose several algorithms to recover the location and intensity of a radiation source located in a simulated 250 × 180 m block of an urban center based on synthetic measurements. Radioactive decay and detection are Poisson random processes, so we employ likelihood functions based on this distribution. Owing to the domain geometry and the proposed response model, the negative logarithm of the likelihood is only piecewise continuous differentiable, and it has multiple local minima. To address these difficulties, we investigate three hybrid algorithms composed of mixed optimization techniques. For global optimization, we consider simulated annealing, particle swarm, and genetic algorithm, which rely solely on objective function evaluations; that is, they do not evaluate the gradient in the objective function. By employing early stopping criteria for the global optimization methods, a pseudo-optimum point is obtained. This is subsequently utilized as the initial value by the deterministic implicit filtering method, which is able to find local extrema in non-smooth functions, to finish the search in a narrow domain. These new hybrid techniques, combining global optimization and implicit filtering address, difficulties associated with the non-smooth response, and their performances, are shown to significantly decrease the computational time over the global optimization methods. To quantify uncertainties associated with the source location and intensity, we employ the delayed rejection adaptive Metropolis and DiffeRential Evolution Adaptive Metropolis algorithms. Marginal densities of the source properties are obtained, and the means of the chains compare accurately with the estimates produced by the hybrid algorithms. Copyright © 2016 John Wiley & Sons, Ltd.

25 May 2021 in Statistical Analysis and Data Mining: An ASA Data Science Journal
Verified
Journal Article
Closed access
PDF file
AMAmanda Muyskens
Amanda Muyskens
KSKathleen Schmidt
Kathleen Schmidt
MNMatthew Nelms
Matthew Nelms
NBNathan Barton
Nathan Barton
JFJeffrey Florando
Jeffrey Florando
DRDavid Rivera
David Rivera