IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v168y2016i1d10.1007_s10957-015-0781-1.html
   My bibliography  Save this article

A Modified Hestenes and Stiefel Conjugate Gradient Algorithm for Large-Scale Nonsmooth Minimizations and Nonlinear Equations

Author

Listed:
  • Gonglin Yuan

    (Guangxi University)

  • Zehong Meng

    (Zhejiang University of Finance and Economics)

  • Yong Li

    (Baise University)

Abstract

It is well known that nonlinear conjugate gradient methods are very effective for large-scale smooth optimization problems. However, their efficiency has not been widely investigated for large-scale nonsmooth problems, which are often found in practice. This paper proposes a modified Hestenes–Stiefel conjugate gradient algorithm for nonsmooth convex optimization problems. The search direction of the proposed method not only possesses the sufficient descent property but also belongs to a trust region. Under suitable conditions, the global convergence of the presented algorithm is established. The numerical results show that this method can successfully be used to solve large-scale nonsmooth problems with convex and nonconvex properties (with a maximum dimension of 60,000). Furthermore, we study the modified Hestenes–Stiefel method as a solution method for large-scale nonlinear equations and establish its global convergence. Finally, the numerical results for nonlinear equations are verified, with a maximum dimension of 100,000.

Suggested Citation

  • Gonglin Yuan & Zehong Meng & Yong Li, 2016. "A Modified Hestenes and Stiefel Conjugate Gradient Algorithm for Large-Scale Nonsmooth Minimizations and Nonlinear Equations," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 129-152, January.
    • Handle: RePEc:spr:joptap:v:168:y:2016:i:1:d:10.1007_s10957-015-0781-1
    DOI: 10.1007/s10957-015-0781-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-015-0781-1
    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/s10957-015-0781-1?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. X. J. Tong & L. Qi, 2004. "On the Convergence of a Trust-Region Method for Solving Constrained Nonlinear Equations with Degenerate Solutions," Journal of Optimization Theory and Applications, Springer, vol. 123(1), pages 187-211, October.
    2. Chuanwei Wang & Yiju Wang & Chuanliang Xu, 2007. "A projection method for a system of nonlinear monotone equations with convex constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(1), pages 33-46, August.
    3. J. R. Birge & L. Qi & Z. Wei, 1998. "Convergence Analysis of Some Methods for Minimizing a Nonsmooth Convex Function," Journal of Optimization Theory and Applications, Springer, vol. 97(2), pages 357-383, May.
    4. A. M. Bagirov & B. Karasözen & M. Sezer, 2008. "Discrete Gradient Method: Derivative-Free Method for Nonsmooth Optimization," Journal of Optimization Theory and Applications, Springer, vol. 137(2), pages 317-334, May.
    5. Gonglin Yuan & Zengxin Wei & Zhongxing Wang, 2013. "Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization," Computational Optimization and Applications, Springer, vol. 54(1), pages 45-64, January.
    6. Ju-liang Zhang & Yong Wang, 2003. "A new trust region method for nonlinear equations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 58(2), pages 283-298, November.
    7. Gonglin Yuan & Zengxin Wei & Qiumei Zhao, 2014. "A modified Polak–Ribière–Polyak conjugate gradient algorithm for large-scale optimization problems," IISE Transactions, Taylor & Francis Journals, vol. 46(4), pages 397-413.
    8. Liqun Qi, 1993. "Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 227-244, February.
    9. Gonglin Yuan & Xiwen Lu, 2009. "A modified PRP conjugate gradient method," Annals of Operations Research, Springer, vol. 166(1), pages 73-90, 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. Yong Li & Gonglin Yuan & Zhou Sheng, 2018. "An active-set algorithm for solving large-scale nonsmooth optimization models with box constraints," PLOS ONE, Public Library of Science, vol. 13(1), pages 1-16, January.
    2. XiaoLiang Dong & Deren Han & Zhifeng Dai & Lixiang Li & Jianguang Zhu, 2018. "An Accelerated Three-Term Conjugate Gradient Method with Sufficient Descent Condition and Conjugacy Condition," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 944-961, December.
    3. Qi Tian & Xiaoliang Wang & Liping Pang & Mingkun Zhang & Fanyun Meng, 2021. "A New Hybrid Three-Term Conjugate Gradient Algorithm for Large-Scale Unconstrained Problems," Mathematics, MDPI, vol. 9(12), pages 1-13, June.
    4. Khalid Abdulaziz Alnowibet & Salem Mahdi & Ahmad M. Alshamrani & Karam M. Sallam & Ali Wagdy Mohamed, 2022. "A Family of Hybrid Stochastic Conjugate Gradient Algorithms for Local and Global Minimization Problems," Mathematics, MDPI, vol. 10(19), pages 1-37, October.
    5. Gonglin Yuan & Zhou Sheng & Wenjie Liu, 2016. "The Modified HZ Conjugate Gradient Algorithm for Large-Scale Nonsmooth Optimization," PLOS ONE, Public Library of Science, vol. 11(10), pages 1-15, October.
    6. 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.
    7. Ahmad M. Alshamrani & Adel Fahad Alrasheedi & Khalid Abdulaziz Alnowibet & Salem Mahdi & Ali Wagdy Mohamed, 2022. "A Hybrid Stochastic Deterministic Algorithm for Solving Unconstrained Optimization Problems," Mathematics, MDPI, vol. 10(17), pages 1-26, August.
    8. Zhou Sheng & Gonglin Yuan, 2018. "An effective adaptive trust region algorithm for nonsmooth minimization," Computational Optimization and Applications, Springer, vol. 71(1), pages 251-271, September.
    9. Morteza Kimiaei & Farzad Rahpeymaii, 2019. "A new nonmonotone line-search trust-region approach for nonlinear systems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(2), pages 199-232, July.
    10. Zexian Liu & Hongwei Liu, 2019. "An Efficient Gradient Method with Approximately Optimal Stepsize Based on Tensor Model for Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 608-633, May.
    11. Luyun Wang & Bo Zhou, 2023. "A Modified Gradient Method for Distributionally Robust Logistic Regression over the Wasserstein Ball," Mathematics, MDPI, vol. 11(11), pages 1-15, May.
    12. Xiaoliang Wang & Liping Pang & Qi Wu & Mingkun Zhang, 2021. "An Adaptive Proximal Bundle Method with Inexact Oracles for a Class of Nonconvex and Nonsmooth Composite Optimization," Mathematics, MDPI, vol. 9(8), pages 1-27, April.
    13. Xiaoyu Wu & Hu Shao & Pengjie Liu & Yue Zhuo, 2023. "An Inertial Spectral CG Projection Method Based on the Memoryless BFGS Update," Journal of Optimization Theory and Applications, Springer, vol. 198(3), pages 1130-1155, September.

    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. Gonglin Yuan & Zengxin Wei & Zhongxing Wang, 2013. "Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization," Computational Optimization and Applications, Springer, vol. 54(1), pages 45-64, January.
    2. Gonglin Yuan & Xiabin Duan & Wenjie Liu & Xiaoliang Wang & Zengru Cui & Zhou Sheng, 2015. "Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models," PLOS ONE, Public Library of Science, vol. 10(10), pages 1-24, October.
    3. Tsegay Giday Woldu & Haibin Zhang & Xin Zhang & Yemane Hailu Fissuh, 2020. "A Modified Nonlinear Conjugate Gradient Algorithm for Large-Scale Nonsmooth Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 185(1), pages 223-238, April.
    4. J. Chen & L. Qi, 2010. "Pseudotransient Continuation for Solving Systems of Nonsmooth Equations with Inequality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 147(2), pages 223-242, November.
    5. Gonglin Yuan & Zhou Sheng & Wenjie Liu, 2016. "The Modified HZ Conjugate Gradient Algorithm for Large-Scale Nonsmooth Optimization," PLOS ONE, Public Library of Science, vol. 11(10), pages 1-15, October.
    6. Yong Li & Gonglin Yuan & Zhou Sheng, 2018. "An active-set algorithm for solving large-scale nonsmooth optimization models with box constraints," PLOS ONE, Public Library of Science, vol. 13(1), pages 1-16, January.
    7. Morteza Kimiaei & Farzad Rahpeymaii, 2019. "A new nonmonotone line-search trust-region approach for nonlinear systems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(2), pages 199-232, July.
    8. 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.
    9. Sha Lu & Zengxin Wei & Lue Li, 2012. "A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization," Computational Optimization and Applications, Springer, vol. 51(2), pages 551-573, March.
    10. Yong Li & Gonglin Yuan & Zengxin Wei, 2015. "A Limited-Memory BFGS Algorithm Based on a Trust-Region Quadratic Model for Large-Scale Nonlinear Equations," PLOS ONE, Public Library of Science, vol. 10(5), pages 1-13, May.
    11. Zhou Sheng & Gonglin Yuan, 2018. "An effective adaptive trust region algorithm for nonsmooth minimization," Computational Optimization and Applications, Springer, vol. 71(1), pages 251-271, September.
    12. 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.
    13. 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.
    14. 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.
    15. G. L. Zhou & L. Caccetta, 2008. "Feasible Semismooth Newton Method for a Class of Stochastic Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 379-392, November.
    16. C. Kanzow & H. Qi & L. Qi, 2003. "On the Minimum Norm Solution of Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 116(2), pages 333-345, February.
    17. Adil M. Bagirov & Julien Ugon & Hijran G. Mirzayeva, 2015. "Nonsmooth Optimization Algorithm for Solving Clusterwise Linear Regression Problems," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 755-780, March.
    18. Kenji Ueda & Nobuo Yamashita, 2012. "Global Complexity Bound Analysis of the Levenberg–Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 152(2), pages 450-467, February.
    19. Wang, John & Yan, Ruiliang & Hollister, Kimberly & Zhu, Dan, 2008. "A historic review of management science research in China," Omega, Elsevier, vol. 36(6), pages 919-932, December.
    20. Y. D. Chen & Y. Gao & Y.-J. Liu, 2010. "An Inexact SQP Newton Method for Convex SC1 Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 33-49, July.

    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:168:y:2016:i:1:d:10.1007_s10957-015-0781-1. 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.