Minimizing a stochastic convex function subject to stochastic constraints and some applications
Author
Abstract
Suggested Citation
DOI: 10.1016/j.spa.2020.07.006
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Ward Whitt, 1981. "The Stationary Distribution of a Stochastic Clearing Process," Operations Research, INFORMS, vol. 29(2), pages 294-308, April.
- Shaler Stidham, 1977. "Cost Models for Stochastic Clearing Systems," Operations Research, INFORMS, vol. 25(1), pages 100-127, February.
- 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.
- 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.
- Ralf Korn, 2005. "Optimal portfolios with a positive lower bound on final wealth," Quantitative Finance, Taylor & Francis Journals, vol. 5(3), pages 315-321.
- 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.
- Peter Lakner & Lan Ma Nygren, 2006. "Portfolio Optimization With Downside Constraints," Mathematical Finance, Wiley Blackwell, vol. 16(2), pages 283-299, April.
- 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, August.
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.- 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.
- Kraft, Holger & Steffensen, Mogens, 2012. "A dynamic programming approach to constrained portfolios," CFS Working Paper Series 2012/07, Center for Financial Studies (CFS).
- 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.
- Kraft, Holger & Steffensen, Mogens, 2013. "A dynamic programming approach to constrained portfolios," European Journal of Operational Research, Elsevier, vol. 229(2), pages 453-461.
- 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.
- Benjamin Avanzi & Hayden Lau & Mogens Steffensen, 2022. "Optimal reinsurance design under solvency constraints," Papers 2203.16108, arXiv.org, revised Jun 2023.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- Valle, C.A. & Meade, N. & Beasley, J.E., 2014. "Absolute return portfolios," Omega, Elsevier, vol. 45(C), pages 20-41.
- Tunay I. Tunca & Weiming Zhu, 2018. "Buyer Intermediation in Supplier Finance," Management Science, INFORMS, vol. 64(12), pages 5631-5650, December.
- Jan Kallsen & Johannes Muhle-Karbe, 2010. "Utility Maximization In Affine Stochastic Volatility Models," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 13(03), pages 459-477.
- Izzet Sahin & Diptendu Sinha, 1987. "Renewal approximation to optimal order quantity for a class of continuous‐review inventory systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 655-667, October.
- L. Rüschendorf & Steven Vanduffel, 2020. "On the construction of optimal payoffs," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 43(1), pages 129-153, June.
- Steffensen, Mogens, 2011. "Optimal consumption and investment under time-varying relative risk aversion," Journal of Economic Dynamics and Control, Elsevier, vol. 35(5), pages 659-667, May.
- Sathaye, Nakul & Madanat, Samer, 2012. "A bottom-up optimal pavement resurfacing solution approach for large-scale networks," Transportation Research Part B: Methodological, Elsevier, vol. 46(4), pages 520-528.
- Sathaye, Nakul & Madanat, Samer, 2011. "A bottom-up solution for the multi-facility optimal pavement resurfacing problem," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1004-1017, August.
More about this item
Keywords
Stochastic constrained minimization; Minimizing a stochastic convex function; Quadratic function with random coefficients; Clearing process; Constrained portfolio optimization; Neyman–Pearson lemma;All these keywords.
Statistics
Access and download statisticsCorrections
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.