A globally convergent iterative algorithm for complementarity problems : a modification of interior point algorithms for linear complementarity problems 相補性問題に対する大域的収束反復解法
Access this Article
Search this Article
Author
Bibliographic Information
- Title
-
A globally convergent iterative algorithm for complementarity problems : a modification of interior point algorithms for linear complementarity problems
- Other Title
-
相補性問題に対する大域的収束反復解法
- Author
-
野間, 俊人
- Author(Another name)
-
ノマ, トシヒト
- University
-
東京工業大学
- Types of degree
-
理学博士
- Grant ID
-
甲第2364号
- Degree year
-
1991-03-26
Note and Description
博士論文
Table of Contents
- 論文目録 / (0002.jp2)
- Contents / p3 (0006.jp2)
- 1.Introduction. / p1 (0007.jp2)
- 2.Basic Analysis. / p8 (0014.jp2)
- 2.1.Assumptions and Fundamental Theorems. / p8 (0014.jp2)
- 2.2.A Family of Trajectories Leading to the Solution Set of CP[ƒ]. / p17 (0023.jp2)
- 2.3.Limiting Behavior of the Trajectory Tc. / p21 (0027.jp2)
- 2.4.A Potential Function Associated with CP[ƒ]. / p29 (0035.jp2)
- 2.5.Level Sets of the Functions [数式], [数式] and [数式]. / p34 (0040.jp2)
- 2.6.Some Kinds of Neighborhoods of the Trajectory Tc. / p39 (0045.jp2)
- 3.A Globally Convergent Iterative Algorithm for CP[ƒ]. / p50 (0056.jp2)
- 3.1. An Iterative Algorithm for Solving CP[ƒ]. / p50 (0056.jp2)
- 3.2.A Sufficient Condition for the Global Convergence of the Algorithm. / p53 (0059.jp2)
- 3.3.A Family of Newton Directions towards the Trajectory Tc. / p56 (0062.jp2)
- 3.4.Armijo's Line Search Procedure. / p63 (0069.jp2)
- 3.5.How to Choose the Merit Function ψ, the Admissible Region Z and the Initial Point z¹. / p66 (0072.jp2)
- 3.6.Some Typical Cases of the Globally Convergent Iterative Algorithm. / p76 (0082.jp2)
- 4.Concluding Remarks. / p80 (0086.jp2)
- References. / p85 (0091.jp2)