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

Nonsmooth Equation Based BFGS Method for Solving KKT Systems in Mathematical Programming

Author

Listed:
  • D. H. Li
  • N. Yamashita
  • M. Fukushima

Abstract

In this paper, we present a BFGS method for solving a KKT system in mathematical programming, based on a nonsmooth equation reformulation of the KKT system. We split successively the nonsmooth equation into equivalent equations with a particular structure. Based on the splitting, we develop a BFGS method in which the subproblems are systems of linear equations with symmetric and positive-definite coefficient matrices. A suitable line search is introduced under which the generated iterates exhibit an approximate norm descent property. The method is well defined and, under suitable conditions, converges to a KKT point globally and superlinearly without any convexity assumption on the problem.

Suggested Citation

  • D. H. Li & N. Yamashita & M. Fukushima, 2001. "Nonsmooth Equation Based BFGS Method for Solving KKT Systems in Mathematical Programming," Journal of Optimization Theory and Applications, Springer, vol. 109(1), pages 123-167, April.
    • Handle: RePEc:spr:joptap:v:109:y:2001:i:1:d:10.1023_a:1017565922109
    DOI: 10.1023/A:1017565922109
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1017565922109
    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:1017565922109?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. Liqun Qi, 1993. "Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 227-244, February.
    2. Shih-Ping Han & Jong-Shi Pang & Narayan Rangaraj, 1992. "Globally Convergent Newton Methods for Nonsmooth Equations," Mathematics of Operations Research, INFORMS, vol. 17(3), pages 586-607, August.
    3. Jong-Shi Pang, 1990. "Newton's Method for B-Differentiable Equations," Mathematics of Operations Research, INFORMS, vol. 15(2), pages 311-341, May.
    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. Long, Qiang & Wu, Changzhi & Wang, Xiangyu, 2015. "A system of nonsmooth equations solver based upon subgradient method," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 284-299.
    2. Masoud Ahookhosh & Arnold Neumaier, 2018. "Solving structured nonsmooth convex optimization with complexity $$\mathcal {O}(\varepsilon ^{-1/2})$$ O ( ε - 1 / 2 )," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 110-145, April.
    3. Bilian Chen & Changfeng Ma, 2011. "A new smoothing Broyden-like method for solving nonlinear complementarity problem with a P 0 -function," Journal of Global Optimization, Springer, vol. 51(3), pages 473-495, November.
    4. Jingyong Tang & Jinchuan Zhou & Zhongfeng Sun, 2023. "A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI," Annals of Operations Research, Springer, vol. 321(1), pages 541-564, February.

    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 & 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.
    2. 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.
    3. 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.
    4. Long, Qiang & Wu, Changzhi & Wang, Xiangyu, 2015. "A system of nonsmooth equations solver based upon subgradient method," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 284-299.
    5. Shenglong Hu & Guoyin Li, 2021. "$${\text {B}}$$ B -subdifferentials of the projection onto the matrix simplex," Computational Optimization and Applications, Springer, vol. 80(3), pages 915-941, December.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Y. Gao, 2004. "Representation of the Clarke Generalized Jacobian via the Quasidifferential," Journal of Optimization Theory and Applications, Springer, vol. 123(3), pages 519-532, December.
    13. 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.
    14. 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.
    15. Shaohua Pan & Jein-Shan Chen & Sangho Kum & Yongdo Lim, 2011. "The penalized Fischer-Burmeister SOC complementarity function," Computational Optimization and Applications, Springer, vol. 49(3), pages 457-491, July.
    16. Kalandrakis, Tasos, 2015. "Computation of equilibrium values in the Baron and Ferejohn bargaining model," Games and Economic Behavior, Elsevier, vol. 94(C), pages 29-38.
    17. Chen Ling & Qin Ni & Liqun Qi & Soon-Yi Wu, 2010. "A new smoothing Newton-type algorithm for semi-infinite programming," Journal of Global Optimization, Springer, vol. 47(1), pages 133-159, May.
    18. 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.
    19. Gerdts, Matthias, 2008. "A nonsmooth Newton’s method for control-state constrained optimal control problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 79(4), pages 925-936.
    20. Jingyong Tang & Jinchuan Zhou, 2020. "Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones," Annals of Operations Research, Springer, vol. 295(2), pages 787-808, December.

    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:109:y:2001:i:1:d:10.1023_a:1017565922109. 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.