| 摘要: |
| An inexact Newton method to the unconstrained
optimization problem, algorithm ACPN(α), is proposed as some improvement on Choleski-PCG
Newton method given in reference Deng N.Y. and Wang Z.Z.(Can Newton method be surpassed.
In Chinese Science Bulletion,1998,Vol.43,No.20,p.132-134). It's more efficient when
variable quantities are between 35 and 186 without the constraints of precisely quadratic
convergence. |
| 关键词: Choleski分解 Choleski-PCG Newton算法 条件预优共轭梯度法 |
| DOI： |
| 修订日期：1999-01-11 |
| 基金项目: |
|
|
|
|
|
| Abstract: |
|
| Key words: |
