IDEAS home Printed from https://ideas.repec.org/a/ibn/masjnl/v2y2008i6p124.html

Study on the GMRES (m) Method of Krylov Subspace and Its Application

Author

Listed:
  • Silin Bai
  • Jianping Liu

Abstract

The Krylov subspace GMRES (m) method is the programming arithmetic based on the projection method. Now, it has become into the excellent arithmetic to solve the linear problem with large scale, and it also can be applied in the nonlinear programming problems. In this article, we translate the nonlinear optimization problems into the non-smooth equations to solve them. We put forward the iterative method of Newton-GMRES to solve the non-smooth equations, and for large-sized problem, this method is especially applied. And the samples also prove the validity of this method.

Suggested Citation

  • Silin Bai & Jianping Liu, 2008. "Study on the GMRES (m) Method of Krylov Subspace and Its Application," Modern Applied Science, Canadian Center of Science and Education, vol. 2(6), pages 124-124, November.
    • Handle: RePEc:ibn:masjnl:v:2:y:2008:i:6:p:124
    as

    Download full text from publisher

    File URL: https://ccsenet.org/journal/index.php/mas/article/download/2131/2001
    Download Restriction: no
    File URL: https://ccsenet.org/journal/index.php/mas/article/view/2131
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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)

    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. H. Xu & X. W. Chang, 1997. "Approximate Newton Methods for Nonsmooth Equations," Journal of Optimization Theory and Applications, Springer, vol. 93(2), pages 373-394, May.
    2. 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.
    3. Shuhuang Xiang & Xiaojun Chen, 2011. "Computation of generalized differentials in nonlinear complementarity problems," Computational Optimization and Applications, Springer, vol. 50(2), pages 403-423, October.
    4. 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.
    5. 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.
    6. F. Facchinei & C. Lazzari, 2003. "Local Feasible QP-Free Algorithms for the Constrained Minimization of SC1 Functions," Journal of Optimization Theory and Applications, Springer, vol. 119(2), pages 281-316, November.
    7. 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.
    8. 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.
    9. Yasushi Narushima & Hideho Ogasawara & Shunsuke Hayashi, 2013. "A Smoothing Method with Appropriate Parameter Control Based on Fischer‐Burmeister Function for Second‐Order Cone Complementarity Problems," Abstract and Applied Analysis, John Wiley & Sons, vol. 2013(1).
    10. Boshi Tian & Xiaoxing Chang, 2025. "A reweighted $$\ell _1$$ ℓ 1 -penalty method for nonlinear complementarity problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 101(1), pages 95-110, February.
    11. Joydeep Dutta & Lahoussine Lafhim & Alain Zemkoho & Shenglong Zhou, 2025. "Nonconvex Quasi-Variational Inequalities: Stability Analysis and Application to Numerical Optimization," Journal of Optimization Theory and Applications, Springer, vol. 204(2), pages 1-43, February.
    12. 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.
    13. Zhang, Jian-Jun, 2015. "The relaxed nonlinear PHSS-like iteration method for absolute value equations," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 266-274.
    14. Shummin Nakayama & Yasushi Narushima & Hiroshi Yabe, 2024. "Inexact proximal DC Newton-type method for nonconvex composite functions," Computational Optimization and Applications, Springer, vol. 87(2), pages 611-640, March.
    15. 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.
    16. Shaohua Pan & Shujun Bi & Jein-Shan Chen, 2013. "Nonsingularity Conditions for FB System of Reformulating Nonlinear Second‐Order Cone Programming," Abstract and Applied Analysis, John Wiley & Sons, vol. 2013(1).
    17. James V. Burke & Song Xu, 1998. "The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 23(3), pages 719-734, August.
    18. 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.
    19. 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.
    20. M. A. Tawhid & J. L. Goffin, 2008. "On Minimizing Some Merit Functions for Nonlinear Complementarity Problems under H-Differentiability," Journal of Optimization Theory and Applications, Springer, vol. 139(1), pages 127-140, October.

    More about this item

    JEL classification:

    • R00 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General - - - General
    • Z0 - Other Special Topics - - General

    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:ibn:masjnl:v:2:y:2008:i:6:p:124. 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: Canadian Center of Science and Education (email available below). General contact details of provider: https://edirc.repec.org/data/cepflch.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.