相关期刊:《Journal of Beijing Institute of Technology》《中国多媒体与网络教学学报(电子版)》《Applied Mathematics and Mechanics(English Edition)》《World Journal of Nephrology》更多>>
The Project Suppoted by the National Natural Science Foundation (40075023).
An analysis on the property of Self-Scaling Rank One Update (SSR1) is given. In view of it, we explore whether the SSR1 update without using exact line search possesses the finite termination property when it is appli...
This work was supported by the National Natural Science Foundation of China.
This paper represents an inexact sequential quadratic programming (SQP ) algorithm which can solve nonlinear programming (NLP ) problems. An inexact solution of the quadratic programming subproblem is determined by a ...
As concrns fletcher-Reeues algorithm,Powell showed its convergence in the case of ex- act linear search.In 1985,Al-Baali proved its conver gence when a parameter b2belangs to (0,1/ 2)for inexact linear search.and an o...
A conic Newton method is attractive because it converges to a local minimizzer rapidly from any sufficiently good initial guess. However, it may be expensive to solve the conic Newton equation at each iterate. In this...
This work is supported by the National Natural Science Foundation of China
In this paper we consider the global convergence of any conjugate gradient method of the form d1=-g1,dk+1=-gk+1+βkdk(k≥1)with any βk satisfying sume conditions,and with the strong wolfe line search conditions.Under...