Projects per year
Abstract
This article develops a new algorithm named TTRISK to solve high-dimensional risk-averse optimization problems governed by differential equations (ODEs and/or partial differential equations [PDEs]) under uncertainty. As an example, we focus on the so-called Conditional Value at Risk (CVaR), but the approach is equally applicable to other coherent risk measures. Both the full and reduced space formulations are considered. The algorithm is based on low rank tensor approximations of random fields discretized using stochastic collocation. To avoid nonsmoothness of the objective function underpinning the CVaR, we propose an adaptive strategy to select the width parameter of the smoothed CVaR to balance the smoothing and tensor approximation errors. Moreover, unbiased Monte Carlo CVaR estimate can be computed by using the smoothed CVaR as a control variate. To accelerate the computations, we introduce an efficient preconditioner for the Karush–Kuhn–Tucker (KKT) system in the full space formulation.The numerical experiments demonstrate that the proposed method enables accurate CVaR optimization constrained by large-scale discretized systems. In particular, the first example consists of an elliptic PDE with random coefficients as constraints. The second example is motivated by a realistic application to devise a lockdown plan for United Kingdom under COVID-19. The results indicate that the risk-averse framework is feasible with the tensor approximations under tens of random variables.
Original language | English |
---|---|
Article number | e2481 |
Journal | Numerical Linear Algebra with Applications |
Volume | 30 |
Issue number | 3 |
Early online date | 3 Dec 2022 |
DOIs | |
Publication status | Published - 31 May 2023 |
Bibliographical note
Funding Information:Harbir Antil and Akwum Onwunta are partially supported by NSF grants DMS‐2110263, DMS‐1913004 and the Air Force Office of Scientific Research under Award number: FA9550‐19‐1‐0036 and FA9550‐22‐1‐0248. Sergey Dolgov is thankful for the support from Engineering and Physical Sciences Research Council (EPSRC) New Investigator Award EP/T031255/1 and New Horizons grant EP/V04771X/1.
Funding Information:
Air Force Office of Scientific Research, Grant/Award Numbers: FA9550‐19‐1‐0036; FA9550‐22‐1‐0248; Engineering and Physical Sciences Research Council, Grant/Award Number: EP/T031255/1; EP/V04771X/1; National Science Foundation, Grant/Award Numbers: DMS‐2110263; DMS‐1913004 Funding information
Funding
Air Force Office of Scientific Research, Grant/Award Numbers: FA9550‐19‐1‐0036; FA9550‐22‐1‐0248; Engineering and Physical Sciences Research Council, Grant/Award Number: EP/T031255/1; EP/V04771X/1; National Science Foundation, Grant/Award Numbers: DMS‐2110263; DMS‐1913004 Funding information Harbir Antil and Akwum Onwunta are partially supported by NSF grants DMS‐2110263, DMS‐1913004 and the Air Force Office of Scientific Research under Award number: FA9550‐19‐1‐0036 and FA9550‐22‐1‐0248. Sergey Dolgov is thankful for the support from Engineering and Physical Sciences Research Council (EPSRC) New Investigator Award EP/T031255/1 and New Horizons grant EP/V04771X/1.
Keywords
- CVaR
- full space
- preconditioner
- reduced space
- risk measures
- tensor train
- TTRISK
ASJC Scopus subject areas
- Algebra and Number Theory
- Applied Mathematics
Fingerprint
Dive into the research topics of 'TTRISK: Tensor train decomposition algorithm for risk averse optimization'. Together they form a unique fingerprint.-
Tensor decomposition sampling algorithms for Bayesian inverse problems
Dolgov, S. (PI)
Engineering and Physical Sciences Research Council
1/03/21 → 28/02/25
Project: Research council
-
Overcoming the curse of dimensionality in dynamic programming by tensor decompositions
Dolgov, S. (PI)
Engineering and Physical Sciences Research Council
10/05/21 → 9/05/23
Project: Research council