IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v130y2020i11p7004-7018.html
   My bibliography  Save this article

Minimizing a stochastic convex function subject to stochastic constraints and some applications

Author

Listed:
  • Jacobovic, Royi
  • Kella, Offer

Abstract

In the simplest case, we obtain a general solution to a problem of minimizing an integral of a nondecreasing right continuous stochastic process from zero to some nonnegative random variable τ, under the constraints that for some nonnegative random variable T, τ∈[0,T] almost surely and Eτ=α (or Eτ≤α) for some α. The nondecreasing process and T are allowed to be dependent. In fact a more general setup involving σ finite measures, rather than just probability measures is considered and some consequences for families of stochastic processes are given as special cases. Various applications are provided.

Suggested Citation

  • Jacobovic, Royi & Kella, Offer, 2020. "Minimizing a stochastic convex function subject to stochastic constraints and some applications," Stochastic Processes and their Applications, Elsevier, vol. 130(11), pages 7004-7018.
    • Handle: RePEc:eee:spapps:v:130:y:2020:i:11:p:7004-7018
    DOI: 10.1016/j.spa.2020.07.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414920303173
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spa.2020.07.006?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. Ward Whitt, 1981. "The Stationary Distribution of a Stochastic Clearing Process," Operations Research, INFORMS, vol. 29(2), pages 294-308, April.
    2. Shaler Stidham, 1977. "Cost Models for Stochastic Clearing Systems," Operations Research, INFORMS, vol. 25(1), pages 100-127, February.
    3. Hanqing Jin & Zuo Quan Xu & Xun Yu Zhou, 2008. "A Convex Stochastic Optimization Problem Arising From Portfolio Selection," Mathematical Finance, Wiley Blackwell, vol. 18(1), pages 171-183, January.
    4. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    5. Royi Jacobovic & Offer Kella, 2019. "Asymptotic independence of regenerative processes with a special dependence structure," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 139-152, October.
    6. Ralf Korn, 2005. "Optimal portfolios with a positive lower bound on final wealth," Quantitative Finance, Taylor & Francis Journals, vol. 5(3), pages 315-321.
    7. Peter Lakner & Lan Ma Nygren, 2006. "Portfolio Optimization With Downside Constraints," Mathematical Finance, Wiley Blackwell, vol. 16(2), pages 283-299, April.
    8. Ralf Korn, 1997. "Optimal Portfolios:Stochastic Models for Optimal Investment and Risk Management in Continuous Time," World Scientific Books, World Scientific Publishing Co. Pte. Ltd., number 3548, December.
    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. Marcos Escobar-Anel, 2022. "A dynamic programming approach to path-dependent constrained portfolios," Annals of Operations Research, Springer, vol. 315(1), pages 141-157, August.
    2. Frank Seifried, 2010. "Optimal investment with deferred capital gains taxes," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 71(1), pages 181-199, February.
    3. Kraft, Holger & Steffensen, Mogens, 2012. "A dynamic programming approach to constrained portfolios," CFS Working Paper Series 2012/07, Center for Financial Studies (CFS).
    4. Benjamin Avanzi & Hayden Lau & Mogens Steffensen, 2022. "Optimal reinsurance design under solvency constraints," Papers 2203.16108, arXiv.org, revised Jun 2023.
    5. Yuan, Haili & Hu, Yijun, 2009. "Optimal consumption and portfolio policies with the consumption habit constraints and the terminal wealth downside constraints," Insurance: Mathematics and Economics, Elsevier, vol. 45(3), pages 405-409, December.
    6. Royi Jacobovic & Offer Kella, 2019. "Asymptotic independence of regenerative processes with a special dependence structure," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 139-152, October.
    7. Hambardzumyan, Hayk & Korn, Ralf, 2019. "Dynamic hybrid products with guarantees—An optimal portfolio framework," Insurance: Mathematics and Economics, Elsevier, vol. 84(C), pages 54-66.
    8. Kraft, Holger & Steffensen, Mogens, 2013. "A dynamic programming approach to constrained portfolios," European Journal of Operational Research, Elsevier, vol. 229(2), pages 453-461.
    9. Bank, Peter & Riedel, Frank, 1999. "Optimal consumption choice under uncertainty with intertemporal substitution," SFB 373 Discussion Papers 1999,71, Humboldt University of Berlin, Interdisciplinary Research Project 373: Quantification and Simulation of Economic Processes.
    10. Artalejo, J. R., 2000. "G-networks: A versatile approach for work removal in queueing networks," European Journal of Operational Research, Elsevier, vol. 126(2), pages 233-249, October.
    11. Karamzadeh, M. & Soltani, A.R. & Mardani-Fard, H.A., 2020. "On a class of spatial renewal processes: Renewal processes synchronization probabilities," Statistics & Probability Letters, Elsevier, vol. 158(C).
    12. Weiyang Ding & Michael K. Ng & Wenxing Zhang, 2024. "A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression," Journal of Global Optimization, Springer, vol. 90(3), pages 727-753, November.
    13. Thijs Klauw & Marco E. T. Gerards & Johann L. Hurink, 2017. "Resource allocation problems in decentralized energy management," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(3), pages 749-773, July.
    14. Guo, Fenglong, 2022. "Ruin probability of a continuous-time model with dependence between insurance and financial risks caused by systematic factors," Applied Mathematics and Computation, Elsevier, vol. 413(C).
    15. Marcos Escobar-Anel & Michel Kschonnek & Rudi Zagst, 2022. "Portfolio optimization: not necessarily concave utility and constraints on wealth and allocation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(1), pages 101-140, February.
    16. Qi‐Ming He & James H. Bookbinder & Qishu Cai, 2020. "Optimal policies for stochastic clearing systems with time‐dependent delay penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(7), pages 487-502, October.
    17. Jungho Park & Hadi El-Amine & Nevin Mutlu, 2021. "An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1213-1228, July.
    18. Kenneth David Strang, 2012. "Man versus math: Behaviorist exploration of post-crisis non-banking asset management," Journal of Asset Management, Palgrave Macmillan, vol. 13(5), pages 348-367, October.
    19. Guohui Guan & Zongxia Liang & Yi xia, 2021. "Optimal management of DC pension fund under relative performance ratio and VaR constraint," Papers 2103.04352, arXiv.org.
    20. Kamma, Thijs & Pelsser, Antoon, 2022. "Near-optimal asset allocation in financial markets with trading constraints," European Journal of Operational Research, Elsevier, vol. 297(2), pages 766-781.

    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:eee:spapps:v:130:y:2020:i:11:p:7004-7018. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    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.