IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v85y2023i2d10.1007_s10589-023-00461-8.html
   My bibliography  Save this article

A relaxation-based probabilistic approach for PDE-constrained optimization under uncertainty with pointwise state constraints

Author

Listed:
  • Drew P. Kouri

    (Sandia National Laboratories)

  • Mathias Staudigl

    (Maastricht University)

  • Thomas M. Surowiec

    (Simula Research Laboratory)

Abstract

We consider a class of convex risk-neutral PDE-constrained optimization problems subject to pointwise control and state constraints. Due to the many challenges associated with almost sure constraints on pointwise evaluations of the state, we suggest a relaxation via a smooth functional bound with similar properties to well-known probability constraints. First, we introduce and analyze the relaxed problem, discuss its asymptotic properties, and derive formulae for the gradient the adjoint calculus. We then build on the theoretical results by extending a recently published online convex optimization algorithm (OSA) to the infinite-dimensional setting. Similar to the regret-based analysis of time-varying stochastic optimization problems, we enhance the method further by allowing for periodic restarts at pre-defined epochs. Not only does this allow for larger step sizes, it also proves to be an essential factor in obtaining high-quality solutions in practice. The behavior of the algorithm is demonstrated in a numerical example involving a linear advection–diffusion equation with random inputs. In order to judge the quality of the solution, the results are compared to those arising from a sample average approximation (SAA). This is done first by comparing the resulting cumulative distributions of the objectives at the optimal solution as a function of step numbers and epoch lengths. In addition, we conduct statistical tests to further analyze the behavior of the online algorithm and the quality of its solutions. For a sufficiently large number of steps, the solutions from OSA and SAA lead to random integrands for the objective and penalty functions that appear to be drawn from similar distributions.

Suggested Citation

  • Drew P. Kouri & Mathias Staudigl & Thomas M. Surowiec, 2023. "A relaxation-based probabilistic approach for PDE-constrained optimization under uncertainty with pointwise state constraints," Computational Optimization and Applications, Springer, vol. 85(2), pages 441-478, June.
    • Handle: RePEc:spr:coopap:v:85:y:2023:i:2:d:10.1007_s10589-023-00461-8
    DOI: 10.1007/s10589-023-00461-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-023-00461-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-023-00461-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Willem Haneveld & Maarten Vlerk, 2006. "Integrated Chance Constraints: Reduced Forms and an Algorithm," Computational Management Science, Springer, vol. 3(4), pages 245-269, September.
    2. Andrieu, L. & Henrion, R. & Römisch, W., 2010. "A model for dynamic chance constraints in hydro power reservoir management," European Journal of Operational Research, Elsevier, vol. 207(2), pages 579-589, December.
    3. René Henrion & Andris Möller, 2012. "A Gradient Formula for Linear Chance Constraints Under Gaussian Distribution," Mathematics of Operations Research, INFORMS, vol. 37(3), pages 475-488, August.
    4. Guanghui Lan & Zhiqiang Zhou, 2020. "Algorithms for stochastic optimization with function or expectation constraints," Computational Optimization and Applications, Springer, vol. 76(2), pages 461-498, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lukáš Adam & Martin Branda, 2016. "Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 419-436, August.
    2. Lukáš Adam & Martin Branda & Holger Heitsch & René Henrion, 2020. "Solving joint chance constrained problems using regularization and Benders’ decomposition," Annals of Operations Research, Springer, vol. 292(2), pages 683-709, September.
    3. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    4. D. Kuhn, 2009. "Convergent Bounds for Stochastic Programs with Expected Value Constraints," Journal of Optimization Theory and Applications, Springer, vol. 141(3), pages 597-618, June.
    5. Dirk Lorenz & Marc Pfetsch & Andreas Tillmann, 2014. "An infeasible-point subgradient method using adaptive approximate projections," Computational Optimization and Applications, Springer, vol. 57(2), pages 271-306, March.
    6. Juan Ma & Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Vladimir Boginski, 2016. "The Minimum Spanning k -Core Problem with Bounded CVaR Under Probabilistic Edge Failures," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 295-307, May.
    7. Ken Kobayashi & Yuichi Takano & Kazuhide Nakata, 2021. "Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 493-528, October.
    8. Streutker, Matthijs & van der Vlerk, Maarten & Klein Haneveld, Wim, 2007. "Implementation of new regulatory rules in a multistage ALM model for Dutch pension funds," Research Report 07005, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    9. Chen, Zhen & Archibald, Thomas W., 2024. "Maximizing the survival probability in a cash flow inventory problem with a joint service level constraint," International Journal of Production Economics, Elsevier, vol. 270(C).
    10. Mohd Azdi Maasar & Diana Roman & Paresh Date, 2022. "Risk minimisation using options and risky assets," Operational Research, Springer, vol. 22(1), pages 485-506, March.
    11. Liwei Zhang & Yule Zhang & Jia Wu & Xiantao Xiao, 2022. "Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2989-3006, November.
    12. Andre Luiz Diniz & Maria Elvira P. Maceira & Cesar Luis V. Vasconcellos & Debora Dias J. Penna, 2020. "A combined SDDP/Benders decomposition approach with a risk-averse surface concept for reservoir operation in long term power generation planning," Annals of Operations Research, Springer, vol. 292(2), pages 649-681, September.
    13. Gong, Jiangyue & Gujjula, Krishna Reddy & Ntaimo, Lewis, 2023. "An integrated chance constraints approach for optimal vaccination strategies under uncertainty for COVID-19," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
    14. Zhi-Hai Zhang & Kang Li, 2015. "A novel probabilistic formulation for locating and sizing emergency medical service stations," Annals of Operations Research, Springer, vol. 229(1), pages 813-835, June.
    15. Michel Minoux & Riadh Zorgati, 2019. "Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems," Journal of Global Optimization, Springer, vol. 75(3), pages 735-766, November.
    16. Alessandro Balata & Michael Ludkovski & Aditya Maheshwari & Jan Palczewski, 2019. "Statistical Learning for Probability-Constrained Stochastic Optimal Control," Papers 1905.00107, arXiv.org, revised Aug 2020.
    17. Butyn, Emerson & Karas, Elizabeth W. & de Oliveira, Welington, 2022. "A derivative-free trust-region algorithm with copula-based models for probability maximization problems," European Journal of Operational Research, Elsevier, vol. 298(1), pages 59-75.
    18. Nilay Noyan, 2010. "Alternate risk measures for emergency medical service system design," Annals of Operations Research, Springer, vol. 181(1), pages 559-589, December.
    19. repec:dgr:rugsom:07005 is not listed on IDEAS
    20. I. Bremer & R. Henrion & A. Möller, 2015. "Probabilistic constraints via SQP solver: application to a renewable energy management problem," Computational Management Science, Springer, vol. 12(3), pages 435-459, July.
    21. Guigues, Vincent & Sagastizábal, Claudia, 2012. "The value of rolling-horizon policies for risk-averse hydro-thermal planning," European Journal of Operational Research, Elsevier, vol. 217(1), pages 129-140.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:85:y:2023:i:2:d:10.1007_s10589-023-00461-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.