A NOTE ON GLOBALLY CONVERGENT NEWTON METHOD FOR STRONGLY MONOTONE VARIATIONAL INEQUALITIES

• Taji Kouichi

  Department of Mechanical Science and Engineering Graduate School of Engineering Nagoya University

抄録

Newton's method for solving variational inequalities is known to be locally quadratically convergent. By incorporating a line search strategy for the regularized gap function, Taji et al. (Mathematical Programming, 1993) have proposed a modification of a Newton's method which is globally convergent and whose rate of convergence is quadratic. But the quadratic convergence has been shown only under the assumptions that the constraint set is polyhedral convex and the strict complementarity condition holds at the solution. In this paper, we show that the quadratic rate of convergence is also achieved without both the polyhedral convex assumption and the strict complementarity condition. Moreover, the line search procedure is simplified.

収録刊行物

• 日本オペレーションズ・リサーチ学会論文誌

  日本オペレーションズ・リサーチ学会論文誌 51 (4), 310-316, 2008

  公益社団法人 日本オペレーションズ・リサーチ学会

キーワード

• Nonlinear programming
• variational inequality
• Newton's method
• regularized gap function

詳細情報

• CRID: 1390001204109225600
• NII論文ID: 110007008324
• NII書誌ID: AA00703935
• DOI: 10.15807/jorsj.51.310
• ISSN: 21888299
• ISSN: 04534514
• NDL書誌ID: 10447501
• Web Site: http://id.ndl.go.jp/bib/10447501
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I10447501
• Web Site: https://www.jstage.jst.go.jp/article/jorsj/51/4/51_KJ00005106009/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可