IDEAS home Printed from https://ideas.repec.org/p/wop/iasawp/wp94013.html
   My bibliography  Save this paper

A Bundle of Method for Minimizing a Sum of Convex Functions with Smooth Weights

Author

Listed:
  • K. Kiwiel

Abstract

No abstract is available for this item.

Suggested Citation

  • K. Kiwiel, 1994. "A Bundle of Method for Minimizing a Sum of Convex Functions with Smooth Weights," Working Papers wp94013, International Institute for Applied Systems Analysis.
  • Handle: RePEc:wop:iasawp:wp94013
    as

    Download full text from publisher

    File URL: http://www.iiasa.ac.at/Publications/Documents/WP-94-013.ps
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    2. Robert Mifflin, 1977. "An Algorithm for Constrained Optimization with Semismooth Functions," Mathematics of Operations Research, INFORMS, vol. 2(2), pages 191-207, May.
    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. Lee, Jinkyu & Bae, Sanghyeon & Kim, Woo Chang & Lee, Yongjae, 2023. "Value function gradient learning for large-scale multistage stochastic programming problems," European Journal of Operational Research, Elsevier, vol. 308(1), pages 321-335.
    2. Lars M. Hvattum & Arne Løkketangen & Gilbert Laporte, 2006. "Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic," Transportation Science, INFORMS, vol. 40(4), pages 421-438, November.
    3. Xin Huang & Duan Li & Daniel Zhuoyu Long, 2020. "Scenario-decomposition Solution Framework for Nonseparable Stochastic Control Problems," Papers 2010.08985, arXiv.org.
    4. Özgün Elçi & John Hooker, 2022. "Stochastic Planning and Scheduling with Logic-Based Benders Decomposition," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2428-2442, September.
    5. Gauvin, Charles & Delage, Erick & Gendreau, Michel, 2017. "Decision rule approximations for the risk averse reservoir management problem," European Journal of Operational Research, Elsevier, vol. 261(1), pages 317-336.
    6. Castro, Jordi & Escudero, Laureano F. & Monge, Juan F., 2023. "On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach," European Journal of Operational Research, Elsevier, vol. 310(1), pages 268-285.
    7. Wu, Dexiang & Wu, Desheng Dash, 2020. "A decision support approach for two-stage multi-objective index tracking using improved lagrangian decomposition," Omega, Elsevier, vol. 91(C).
    8. Kevin Ryan & Shabbir Ahmed & Santanu S. Dey & Deepak Rajan & Amelia Musselman & Jean-Paul Watson, 2020. "Optimization-Driven Scenario Grouping," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 805-821, July.
    9. Fan, Yingjie & Schwartz, Frank & Voß, Stefan, 2017. "Flexible supply chain planning based on variable transportation modes," International Journal of Production Economics, Elsevier, vol. 183(PC), pages 654-666.
    10. Smail Addoune & Karima Boufi & Ahmed Roubi, 2018. "Proximal Bundle Algorithms for Nonlinearly Constrained Convex Minimax Fractional Programs," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 212-239, October.
    11. Listes, O.L. & Dekker, R., 2002. "A scenario aggregation based approach for determining a robust airline fleet composition," Econometric Institute Research Papers EI 2002-17, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    12. Teemu Pennanen & Markku Kallio, 2006. "A splitting method for stochastic programs," Annals of Operations Research, Springer, vol. 142(1), pages 259-268, February.
    13. Barry C. Smith & Ellis L. Johnson, 2006. "Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition," Transportation Science, INFORMS, vol. 40(4), pages 497-516, November.
    14. Gilles Bareilles & Yassine Laguel & Dmitry Grishchenko & Franck Iutzeler & Jérôme Malick, 2020. "Randomized Progressive Hedging methods for multi-stage stochastic programming," Annals of Operations Research, Springer, vol. 295(2), pages 535-560, December.
    15. Andreatta, Giovanni & Dell'Olmo, Paolo & Lulli, Guglielmo, 2011. "An aggregate stochastic programming model for air traffic flow management," European Journal of Operational Research, Elsevier, vol. 215(3), pages 697-704, December.
    16. Huang, Edward & Mital, Pratik & Goetschalckx, Marc & Wu, Kan, 2016. "Optimal assignment of airport baggage unloading zones to outgoing flights," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 110-122.
    17. Hu, Shaolong & Han, Chuanfeng & Dong, Zhijie Sasha & Meng, Lingpeng, 2019. "A multi-stage stochastic programming model for relief distribution considering the state of road network," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 64-87.
    18. Zhicheng Zhu & Yisha Xiang & Bo Zeng, 2021. "Multicomponent Maintenance Optimization: A Stochastic Programming Approach," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 898-914, July.
    19. Georgia Fargetta & Antonino Maugeri & Laura Scrimali, 2022. "A Stochastic Nash Equilibrium Problem for Medical Supply Competition," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 354-380, June.
    20. Gregory A. Godfrey & Warren B. Powell, 2001. "An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution," Management Science, INFORMS, vol. 47(8), pages 1101-1112, August.

    More about this item

    Statistics

    Access and download statistics

    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:wop:iasawp:wp94013. 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: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/iiasaat.html .

    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.