David Huckleberry Gutman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
David Huckleberry Gutman has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Javier Peña
Tepper School of Business, Carnegie Mellon University, Pittsburgh, USA
7 shared publications - Allan Gurwicz2 shared publications
- Eduardo Gildin
Texas A&M University, USA
2 shared publications - Leandro Farias Maia
Department of Industrial and Systems Engineering Texas A&M University
2 shared publications - Nam Ho-Nguyen
Discipline of Business Analytics, The University of Sydney, Sydney, Australia
2 shared publications - Ana Carolina Alves Abreu1 shared publication
Latest Publications
- 21 October 2026
- Published by Elsevier in Computers & Geosciences
- Vol. 219
Survival analysis-powered AI in risk-aware data-driven multi-objective optimization for geological CO2 storage
- 21 October 2026
- Published by Elsevier in Computers & Geosciences
- Vol. 219
Survival analysis-powered AI in risk-aware data-driven multi-objective optimization for geological CO2 storage
- 26 February 2025
- Published by Society of Petroleum Engineers (SPE) in SPE Journal
- Vol. 30 (05) , 2837-2854
Assessing Risk in Long-Term CO2 Storage Under Uncertainty via Survival Analysis-Based Surrogates
Summary: Reservoir simulations for CO2 sequestration are computationally expensive because they rely on being run for large timescales. Shortened, cheaper simulation timelines prevent the observation of gas leakages that might occur over a longer duration. In the statistics community, the exclusion of these leakages is called censorship. We propose a fast simulator surrogate that captures these potentially unobservable long-term risks. The crux of our approach is survival analysis, a branch of statistics tailored to handle censored data. Our proposed framework begins by sampling scenarios with varied injection and production rates from a number of geological and flow uncertainty realizations. The potentially censored time to gas leakage is recorded for each simulated scenario. We then leverage a variety of survival analysis methods, ranging from Kaplan-Meier to random survival forests, to create a computationally cheap, and highly interpretable, simulator surrogate. The surrogate can predict the risk of CO2 leakage in new scenarios for significantly shorter simulations than usual in carbon sequestration studies, or no new simulations at all. This eases the computational burden of centuries-long, expensive simulations. To validate our methodology, we constructed an exploratory case study with a shortened monitoring window. The proposed framework is implemented within a compositional simulation model where CO2 is injected into a saline aquifer. To assess the risk of leakage and caprock integrity, we simulated scenarios where we inject CO2 for permanent storage using four injector wells, while five producer wells are used for pressure maintenance. This model is run for 2,000 days under varied permeability realizations to monitor CO2 breakthrough from the production wells. We then infer the occurrence of leakage in new scenarios and compare these results to full simulations via appropriate statistical metrics such as hypothesis testing, metrics tailored for the censored data context, and common prediction metrics. Initial results show that the proposed method predicts time to gas leakage with good accuracy without the need for any new simulations at all. To the best of the authors’ knowledge, this is the first paper to approach the broader reservoir engineering for carbon capture area with survival analysis, a clear fit due to the presence of censored data coming from shortened simulations. Our unique, novel framework yields a simulator surrogate built with techniques never before seen in this context. Also, we fill the gap other approaches leave open by focusing on interpretability, a model quality that is paramount to decision-making under high uncertainty.
- 26 February 2025
- Published by Society of Petroleum Engineers (SPE) in SPE Journal
- Vol. 30 (05) , 2837-2854
Assessing Risk in Long-Term CO2 Storage Under Uncertainty via Survival Analysis-Based Surrogates
Summary: Reservoir simulations for CO2 sequestration are computationally expensive because they rely on being run for large timescales. Shortened, cheaper simulation timelines prevent the observation of gas leakages that might occur over a longer duration. In the statistics community, the exclusion of these leakages is called censorship. We propose a fast simulator surrogate that captures these potentially unobservable long-term risks. The crux of our approach is survival analysis, a branch of statistics tailored to handle censored data. Our proposed framework begins by sampling scenarios with varied injection and production rates from a number of geological and flow uncertainty realizations. The potentially censored time to gas leakage is recorded for each simulated scenario. We then leverage a variety of survival analysis methods, ranging from Kaplan-Meier to random survival forests, to create a computationally cheap, and highly interpretable, simulator surrogate. The surrogate can predict the risk of CO2 leakage in new scenarios for significantly shorter simulations than usual in carbon sequestration studies, or no new simulations at all. This eases the computational burden of centuries-long, expensive simulations. To validate our methodology, we constructed an exploratory case study with a shortened monitoring window. The proposed framework is implemented within a compositional simulation model where CO2 is injected into a saline aquifer. To assess the risk of leakage and caprock integrity, we simulated scenarios where we inject CO2 for permanent storage using four injector wells, while five producer wells are used for pressure maintenance. This model is run for 2,000 days under varied permeability realizations to monitor CO2 breakthrough from the production wells. We then infer the occurrence of leakage in new scenarios and compare these results to full simulations via appropriate statistical metrics such as hypothesis testing, metrics tailored for the censored data context, and common prediction metrics. Initial results show that the proposed method predicts time to gas leakage with good accuracy without the need for any new simulations at all. To the best of the authors’ knowledge, this is the first paper to approach the broader reservoir engineering for carbon capture area with survival analysis, a clear fit due to the presence of censored data coming from shortened simulations. Our unique, novel framework yields a simulator surrogate built with techniques never before seen in this context. Also, we fill the gap other approaches leave open by focusing on interpretability, a model quality that is paramount to decision-making under high uncertainty.
- 8 November 2024
- Published by Springer Nature in Optimization Letters
- Vol. 19 (1) , 1-20
The randomized block coordinate descent method in the Hölder smooth setting
- 8 November 2024
- Published by Springer Nature in Optimization Letters
- Vol. 19 (1) , 1-20
The randomized block coordinate descent method in the Hölder smooth setting
- Open Access
- 29 September 2024
- Published by MDPI AG in Quantum Reports
- Vol. 6 (4) , 509-521
Quantum-Enhanced Generalized Pattern Search Optimization
While the development of quantum computers promises a myriad of advantages over their classical counterparts, care must be taken when designing algorithms that substitute a classical technique with a potentially advantageous quantum method. The probabilistic nature of many quantum algorithms may result in new behavior that could negatively impact the performance of the larger algorithm. The purpose of this work is to preserve the advantages of applying quantum search methods for generalized pattern search algorithms (GPSs) without violating the convergence criteria. It is well known that quantum search methods are able to reduce the expected number of oracle calls needed for finding the solution to a search problem from to However, the number of oracle calls needed to determine that no solution exists with certainty is exceedingly high and potentially infinite. In the case of GPS, this is a significant problem since overlooking a solution during an iteration will violate a needed assumption for convergence. Here, we overcome this problem by introducing the quantum improved point search (QIPS), a classical–quantum hybrid variant of the quantum search algorithm QSearch. QIPS retains the oracle query complexity of QSearch when a solution exists. However, it is able to determine when no solution exists, with certainty, using only oracle calls.- 29 September 2024
- Published by MDPI AG in Quantum Reports
- Vol. 6 (4) , 509-521
Open AccessQuantum-Enhanced Generalized Pattern Search Optimization
While the development of quantum computers promises a myriad of advantages over their classical counterparts, care must be taken when designing algorithms that substitute a classical technique with a potentially advantageous quantum method. The probabilistic nature of many quantum algorithms may result in new behavior that could negatively impact the performance of the larger algorithm. The purpose of this work is to preserve the advantages of applying quantum search methods for generalized pattern search algorithms (GPSs) without violating the convergence criteria. It is well known that quantum search methods are able to reduce the expected number of oracle calls needed for finding the solution to a search problem from to However, the number of oracle calls needed to determine that no solution exists with certainty is exceedingly high and potentially infinite. In the case of GPS, this is a significant problem since overlooking a solution during an iteration will violate a needed assumption for convergence. Here, we overcome this problem by introducing the quantum improved point search (QIPS), a classical–quantum hybrid variant of the quantum search algorithm QSearch. QIPS retains the oracle query complexity of QSearch when a solution exists. However, it is able to determine when no solution exists, with certainty, using only oracle calls. - 13 March 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 201 (2) , 668-698
The Inexact Cyclic Block Proximal Gradient Method and Properties of Inexact Proximal Maps
- 13 March 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 201 (2) , 668-698
The Inexact Cyclic Block Proximal Gradient Method and Properties of Inexact Proximal Maps
- 2 February 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 48 (1) , 127-159
Coordinate Descent Without Coordinates: Tangent Subspace Descent on Riemannian Manifolds
We extend coordinate descent to manifold domains and provide convergence analyses for geodesically convex and nonconvex smooth objective functions. Our key insight is to draw an analogy between coo...
- 2 February 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 48 (1) , 127-159
Coordinate Descent Without Coordinates: Tangent Subspace Descent on Riemannian Manifolds
We extend coordinate descent to manifold domains and provide convergence analyses for geodesically convex and nonconvex smooth objective functions. Our key insight is to draw an analogy between coo...
- 16 June 2022
- Published by Elsevier in Operations Research Letters
- Vol. 50 (5) , 458-462
Cyclic coordinate descent in the Hölder smooth setting
- 16 June 2022
- Published by Elsevier in Operations Research Letters
- Vol. 50 (5) , 458-462
Cyclic coordinate descent in the Hölder smooth setting
- 3 February 2022
- Published by Springer Nature in Mathematical Programming
- Vol. 198 (1) , 443-469
Perturbed Fenchel duality and first-order methods
- 3 February 2022
- Published by Springer Nature in Mathematical Programming
- Vol. 198 (1) , 443-469
Perturbed Fenchel duality and first-order methods
- Open Access
Perturbed Fenchel duality and first-order methods
We show that the iterates generated by a generic first-order meta-algorithm satisfy a canonical perturbed Fenchel duality inequality. The latter in turn readily yields a unified derivation of the best known convergence rates for various popular first-order algorithms including the conditional gradient method as well as the main kinds of Bregman proximal methods: subgradient, gradient, fast gradient, and universal gradient methods.
Open AccessPerturbed Fenchel duality and first-order methods
We show that the iterates generated by a generic first-order meta-algorithm satisfy a canonical perturbed Fenchel duality inequality. The latter in turn readily yields a unified derivation of the best known convergence rates for various popular first-order algorithms including the conditional gradient method as well as the main kinds of Bregman proximal methods: subgradient, gradient, fast gradient, and universal gradient methods.
- 6 May 2020
- Published by Springer Nature in Mathematical Programming
- Vol. 188 (1) , 255-294
The condition number of a function relative to a set
- 6 May 2020
- Published by Springer Nature in Mathematical Programming
- Vol. 188 (1) , 255-294
The condition number of a function relative to a set