IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v76y2020i2d10.1007_s10589-020-00179-x.html
   My bibliography  Save this article

Algorithms for stochastic optimization with function or expectation constraints

Author

Listed:
  • Guanghui Lan

    (Georgia Institute of Technology)

  • Zhiqiang Zhou

    (Georgia Institute of Technology)

Abstract

This paper considers the problem of minimizing an expectation function over a closed convex set, coupled with a function or expectation constraint on either decision variables or problem parameters. We first present a new stochastic approximation (SA) type algorithm, namely the cooperative SA (CSA), to handle problems with the constraint on devision variables. We show that this algorithm exhibits the optimal $${{{\mathcal {O}}}}(1/\epsilon ^2)$$O(1/ϵ2) rate of convergence, in terms of both optimality gap and constraint violation, when the objective and constraint functions are generally convex, where $$\epsilon$$ϵ denotes the optimality gap and infeasibility. Moreover, we show that this rate of convergence can be improved to $${{{\mathcal {O}}}}(1/\epsilon )$$O(1/ϵ) if the objective and constraint functions are strongly convex. We then present a variant of CSA, namely the cooperative stochastic parameter approximation (CSPA) algorithm, to deal with the situation when the constraint is defined over problem parameters and show that it exhibits similar optimal rate of convergence to CSA. It is worth noting that CSA and CSPA are primal methods which do not require the iterations on the dual space and/or the estimation on the size of the dual variables. To the best of our knowledge, this is the first time that such optimal SA methods for solving function or expectation constrained stochastic optimization are presented in the literature.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:coopap:v:76:y:2020:i:2:d:10.1007_s10589-020-00179-x
    DOI: 10.1007/s10589-020-00179-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-020-00179-x
    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-020-00179-x?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. D. Goldfarb & G. Iyengar, 2003. "Robust Portfolio Selection Problems," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 1-38, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Bingkang & Zhao, Huiru & Wang, Xuejie & Zhao, Yihang & Zhang, Yuanyuan & Lu, Hao & Wang, Yuwei, 2022. "Distributionally robust offering strategy of the aggregator integrating renewable energy generator and energy storage considering uncertainty and connections between the mid-to-long-term and spot elec," Renewable Energy, Elsevier, vol. 201(P1), pages 400-417.
    2. Zichong Li & Pin-Yu Chen & Sijia Liu & Songtao Lu & Yangyang Xu, 2024. "Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization," Computational Optimization and Applications, Springer, vol. 87(1), pages 117-147, January.
    3. Lingzi Jin & Xiao Wang, 2022. "A stochastic primal-dual method for a class of nonconvex constrained optimization," Computational Optimization and Applications, Springer, vol. 83(1), pages 143-180, September.
    4. 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.
    5. Kamiar Asgari & Michael J. Neely, 2024. "Nonsmooth projection-free optimization with functional constraints," Computational Optimization and Applications, Springer, vol. 89(3), pages 927-975, December.
    6. Nikhil Devanathan & Stephen Boyd, 2024. "Polyak Minorant Method for Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 203(3), pages 2263-2282, December.
    7. Yuanyuan, Zhang & Huiru, Zhao & Bingkang, Li, 2023. "Distributionally robust comprehensive declaration strategy of virtual power plant participating in the power market considering flexible ramping product and uncertainties," Applied Energy, Elsevier, vol. 343(C).
    8. Bo Wei & William B. Haskell & Sixiang Zhao, 2020. "The CoMirror algorithm with random constraint sampling for convex semi-infinite programming," Annals of Operations Research, Springer, vol. 295(2), pages 809-841, December.
    9. 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.

    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. Kang, Yan-li & Tian, Jing-Song & Chen, Chen & Zhao, Gui-Yu & Li, Yuan-fu & Wei, Yu, 2021. "Entropy based robust portfolio," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 583(C).
    2. Juan F. Monge & Mercedes Landete & Jos'e L. Ruiz, 2016. "Sharpe portfolio using a cross-efficiency evaluation," Papers 1610.00937, arXiv.org, revised Oct 2016.
    3. Man Yiu Tsang & Tony Sit & Hoi Ying Wong, 2022. "Adaptive Robust Online Portfolio Selection," Papers 2206.01064, arXiv.org.
    4. Mainik, Georg & Mitov, Georgi & Rüschendorf, Ludger, 2015. "Portfolio optimization for heavy-tailed assets: Extreme Risk Index vs. Markowitz," Journal of Empirical Finance, Elsevier, vol. 32(C), pages 115-134.
    5. Maillet, Bertrand & Tokpavi, Sessi & Vaucher, Benoit, 2015. "Global minimum variance portfolio optimisation under some model risk: A robust regression-based approach," European Journal of Operational Research, Elsevier, vol. 244(1), pages 289-299.
    6. Paul Glasserman & Wanmo Kang, 2014. "OR Forum—Design of Risk Weights," Operations Research, INFORMS, vol. 62(6), pages 1204-1220, December.
    7. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    8. Jang Ho Kim & Woo Chang Kim & Frank J. Fabozzi, 2017. "Penalizing variances for higher dependency on factors," Quantitative Finance, Taylor & Francis Journals, vol. 17(4), pages 479-489, April.
    9. Maria Scutellà & Raffaella Recchia, 2013. "Robust portfolio asset allocation and risk measures," Annals of Operations Research, Springer, vol. 204(1), pages 145-169, April.
    10. Yilie Huang & Yanwei Jia & Xun Yu Zhou, 2024. "Mean--Variance Portfolio Selection by Continuous-Time Reinforcement Learning: Algorithms, Regret Analysis, and Empirical Study," Papers 2412.16175, arXiv.org.
    11. Ashrafi, Hedieh & Thiele, Aurélie C., 2021. "A study of robust portfolio optimization with European options using polyhedral uncertainty sets," Operations Research Perspectives, Elsevier, vol. 8(C).
    12. Ran Ji & Miguel A. Lejeune, 2021. "Data-Driven Optimization of Reward-Risk Ratio Measures," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1120-1137, July.
    13. Kolm, Petter N. & Tütüncü, Reha & Fabozzi, Frank J., 2014. "60 Years of portfolio optimization: Practical challenges and current trends," European Journal of Operational Research, Elsevier, vol. 234(2), pages 356-371.
    14. Costa, Oswaldo L.V. & de Oliveira Ribeiro, Celma & Rego, Erik Eduardo & Stern, Julio Michael & Parente, Virginia & Kileber, Solange, 2017. "Robust portfolio optimization for electricity planning: An application based on the Brazilian electricity mix," Energy Economics, Elsevier, vol. 64(C), pages 158-169.
    15. Lorenzo Garlappi & Raman Uppal & Tan Wang, 2007. "Portfolio Selection with Parameter and Model Uncertainty: A Multi-Prior Approach," The Review of Financial Studies, Society for Financial Studies, vol. 20(1), pages 41-81, January.
    16. F. Cong & C. W. Oosterlee, 2017. "On Robust Multi-Period Pre-Commitment And Time-Consistent Mean-Variance Portfolio Optimization," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 20(07), pages 1-26, November.
    17. Gautam Sabnis & Debdeep Pati & Anirban Bhattacharya, 2019. "Compressed Covariance Estimation with Automated Dimension Learning," Sankhya A: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 81(2), pages 466-481, December.
    18. Adrian Gepp & Geoff Harris & Bruce Vanstone, 2020. "Financial applications of semidefinite programming: a review and call for interdisciplinary research," Accounting and Finance, Accounting and Finance Association of Australia and New Zealand, vol. 60(4), pages 3527-3555, December.
    19. Katrin Schöttle & Ralf Werner & Rudi Zagst, 2010. "Comparison and robustification of Bayes and Black-Litterman models," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 71(3), pages 453-475, June.
    20. Andrew Butler & Roy H. Kwon, 2021. "Data-driven integration of norm-penalized mean-variance portfolios," Papers 2112.07016, arXiv.org, revised Nov 2022.

    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:76:y:2020:i:2:d:10.1007_s10589-020-00179-x. 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.