IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v116y2003i1d10.1023_a1022122521816.html
   My bibliography  Save this article

An SQP-Type Method and Its Application in Stochastic Programs

Author

Listed:
  • Z. Wei

    (Guangxi University)

  • L. Qi

    (Hong Kong Polytechnic University)

  • X. Chen

    (Shimane University)

Abstract

In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse.

Suggested Citation

  • Z. Wei & L. Qi & X. Chen, 2003. "An SQP-Type Method and Its Application in Stochastic Programs," Journal of Optimization Theory and Applications, Springer, vol. 116(1), pages 205-228, January.
    • Handle: RePEc:spr:joptap:v:116:y:2003:i:1:d:10.1023_a:1022122521816
    DOI: 10.1023/A:1022122521816
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022122521816
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1022122521816?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. Julia L. Higle & Suvrajeet Sen, 1992. "On the Convergence of Algorithms with Implications for Stochastic and Nondifferentiable Optimization," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 112-131, February.
    2. Liqun Qi & Houyuan Jiang, 1997. "Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations," Mathematics of Operations Research, INFORMS, vol. 22(2), pages 301-325, May.
    3. Julia L. Higle & Suvrajeet Sen, 1991. "Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse," Mathematics of Operations Research, INFORMS, vol. 16(3), pages 650-669, August.
    4. Liqun Qi, 1993. "Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 227-244, 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. Gonglin Yuan & Xiaoliang Wang & Zhou Sheng, 2020. "The Projection Technique for Two Open Problems of Unconstrained Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 590-619, 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.
    1. Dong-Hui Li & Liqun Qi & Judy Tam & Soon-Yi Wu, 2004. "A Smoothing Newton Method for Semi-Infinite Programming," Journal of Global Optimization, Springer, vol. 30(2), pages 169-194, November.
    2. Alain B. Zemkoho & Shenglong Zhou, 2021. "Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization," Computational Optimization and Applications, Springer, vol. 78(2), pages 625-674, March.
    3. Shouqiang Du & Liyuan Cui & Yuanyuan Chen & Yimin Wei, 2022. "Stochastic Tensor Complementarity Problem with Discrete Distribution," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 912-929, March.
    4. L. W. Zhang & Z. Q. Xia, 2001. "Newton-Type Methods for Quasidifferentiable Equations," Journal of Optimization Theory and Applications, Springer, vol. 108(2), pages 439-456, February.
    5. Chen Ling & Hongxia Yin & Guanglu Zhou, 2011. "A smoothing Newton-type method for solving the L 2 spectral estimation problem with lower and upper bounds," Computational Optimization and Applications, Springer, vol. 50(2), pages 351-378, October.
    6. M. Jenabi & S. M. T. Fatemi Ghomi & S. A. Torabi & Moeen Sammak Jalali, 2022. "An accelerated Benders decomposition algorithm for stochastic power system expansion planning using sample average approximation," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1304-1336, December.
    7. John Duggan & Tasos Kalandrakis, 2011. "A Newton collocation method for solving dynamic bargaining games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 36(3), pages 611-650, April.
    8. 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.
    9. Liang Chen & Anping Liao, 2020. "On the Convergence Properties of a Second-Order Augmented Lagrangian Method for Nonlinear Programming Problems with Inequality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 187(1), pages 248-265, October.
    10. Saif Benjaafar & Daniel Jiang & Xiang Li & Xiaobo Li, 2022. "Dynamic Inventory Repositioning in On-Demand Rental Networks," Management Science, INFORMS, vol. 68(11), pages 7861-7878, November.
    11. H. Xu & B. M. Glover, 1997. "New Version of the Newton Method for Nonsmooth Equations," Journal of Optimization Theory and Applications, Springer, vol. 93(2), pages 395-415, May.
    12. Ralf Münnich & Ekkehard Sachs & Matthias Wagner, 2012. "Calibration of estimator-weights via semismooth Newton method," Journal of Global Optimization, Springer, vol. 52(3), pages 471-485, March.
    13. Ketabchi, Saeed & Behboodi-Kahoo, Malihe, 2015. "Augmented Lagrangian method within L-shaped method for stochastic linear programs," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 12-20.
    14. Riis, Morten & Andersen, Kim Allan, 2005. "Applying the minimax criterion in stochastic recourse programs," European Journal of Operational Research, Elsevier, vol. 165(3), pages 569-584, September.
    15. Vasileios Kitsikoudis & Pierre Archambeau & Benjamin Dewals & Estanislao Pujades & Philippe Orban & Alain Dassargues & Michel Pirotton & Sebastien Erpicum, 2020. "Underground Pumped-Storage Hydropower (UPSH) at the Martelange Mine (Belgium): Underground Reservoir Hydraulics," Energies, MDPI, vol. 13(14), pages 1-16, July.
    16. Y. Gao, 2006. "Newton Methods for Quasidifferentiable Equations and Their Convergence," Journal of Optimization Theory and Applications, Springer, vol. 131(3), pages 417-428, December.
    17. Xiaotie Chen & David L. Woodruff, 2024. "Distributions and bootstrap for data-based stochastic programming," Computational Management Science, Springer, vol. 21(1), pages 1-21, June.
    18. Sanja Rapajić & Zoltan Papp, 2017. "A nonmonotone Jacobian smoothing inexact Newton method for NCP," Computational Optimization and Applications, Springer, vol. 66(3), pages 507-532, April.
    19. Jeff Linderoth & Alexander Shapiro & Stephen Wright, 2006. "The empirical behavior of sampling methods for stochastic programming," Annals of Operations Research, Springer, vol. 142(1), pages 215-241, February.
    20. J. Han & D. Sun, 1997. "Newton and Quasi-Newton Methods for Normal Maps with Polyhedral Sets," Journal of Optimization Theory and Applications, Springer, vol. 94(3), pages 659-676, September.

    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:joptap:v:116:y:2003:i:1:d:10.1023_a:1022122521816. 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.