scholarly journals Gradient-Based Multiobjective Optimization with Uncertainties

Author(s):  
Sebastian Peitz ◽  
Michael Dellnitz
2014 ◽  
Vol 51 (1) ◽  
pp. 173-182 ◽  
Author(s):  
Kazuhiro Izui ◽  
Takayuki Yamada ◽  
Shinji Nishiwaki ◽  
Kazuto Tanaka

2015 ◽  
Vol 48 (7) ◽  
pp. 1226-1250 ◽  
Author(s):  
Yuki Sato ◽  
Kazuhiro Izui ◽  
Takayuki Yamada ◽  
Shinji Nishiwaki

SPE Journal ◽  
2016 ◽  
Vol 21 (05) ◽  
pp. 1813-1829 ◽  
Author(s):  
Xin Liu ◽  
Albert C. Reynolds

Summary We consider two procedures for multiobjective optimization, the classical weighted-sum (WS) method and the normal-boundary-intersection (NBI) method. To enhance computational efficiency, the methods use gradients calculated with the adjoint method. Our objective is to develop implementations that one can apply for waterflooding optimization under geological uncertainty when we wish to develop well controls that satisfy two objectives: The first is to maximize the expectation of life-cycle net present value (NPV) (commonly referred to as robust optimization), and the second is either to minimize the standard deviation of NPV over that set of plausible reservoir descriptions or to minimize the risk when risk means downside risk. Specifically, minimizing risk refers to maximizing the minimum value of the life-cycle NPV (i.e., is equivalent to a maximum/minimum (max/min) problem). To avoid nondifferentiability issues, we recast the max/min problem as a constrained optimization problem and apply a gradient-based version of either WS or NBI to construct a point on the Pareto front. To deal with the constraints introduced, we derive an augmented-Lagrange algorithm to find points on the Pareto front. To the best of our knowledge, the resulting versions of “constrained” WS and “constrained” NBI were not presented previously in the scientific literature. The methodology is demonstrated for two synthetic reservoirs. We only consider bound constraints in this paper.


2014 ◽  
Vol 2014 (0) ◽  
pp. _J0110203--_J0110203-
Author(s):  
Yuki SATO ◽  
Kazuhiro IZUI ◽  
Takayuki YAMADA ◽  
Shinji NISHIWAKI

2021 ◽  
Vol 26 (2) ◽  
pp. 32
Author(s):  
Stefan Banholzer ◽  
Bennet Gebken ◽  
Lena Reichle ◽  
Stefan Volkwein

The goal in multiobjective optimization is to determine the so-called Pareto set. Our optimization problem is governed by a parameter-dependent semi-linear elliptic partial differential equation (PDE). To solve it, we use a gradient-based set-oriented numerical method. The numerical solution of the PDE by standard discretization methods usually leads to high computational effort. To overcome this difficulty, reduced-order modeling (ROM) is developed utilizing the reduced basis method. These model simplifications cause inexactness in the gradients. For that reason, an additional descent condition is proposed. Applying a modified subdivision algorithm, numerical experiments illustrate the efficiency of our solution approach.


2007 ◽  
Vol 51 (1-2) ◽  
pp. 43
Author(s):  
Balázs Polgár ◽  
Endre Selényi
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document