Zhen-Jun Shi

According to our database, Zhen-Jun Shi authored at least 16 papers between 2004 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2008

Convergence of memory gradient methods.

Zhen-Jun Shi, Jinhua Guo

Int. J. Comput. Math., 2008

A new trust region method with adaptive radius.

Zhen-Jun Shi, Jinhua Guo

Comput. Optim. Appl., 2008

2007

Convergence analysis of adaptive trust region methods.

Zhen-Jun Shi, Xiang-Sun Zhang, Jie Shen

RAIRO Oper. Res., 2007

Convergence of Liu-Storey conjugate gradient method.

Zhen-Jun Shi, Jie Shen

Eur. J. Oper. Res., 2007

Memory gradient method with Goldstein line search.

Zhen-Jun Shi, Jie Shen

Comput. Math. Appl., 2007

2006

On memory gradient method with trust region for unconstrained optimization.

Zhen-Jun Shi, Jie Shen

Numer. Algorithms, 2006

Non-interior Continuation Method for complementarity Problems in Absence of Strict complementarity.

Min Sun, Zhen-Jun Shi

Asia Pac. J. Oper. Res., 2006

Convergence of PRP method with new nonmonotone line search.

Zhen-Jun Shi, Jie Shen

Appl. Math. Comput., 2006

A new class of supermemory gradient methods.

Zhen-Jun Shi, Jie Shen

Appl. Math. Comput., 2006

On step-size estimation of line search methods.

Zhen-Jun Shi, Jie Shen

Appl. Math. Comput., 2006

2005

A new class of memory gradient methods with inexact line searches.

Zhen-Jun Shi

J. Num. Math., 2005

Convergence Property and Modifications of a Memory Gradient Method.

Zhen-Jun Shi, Jie Shen

Asia Pac. J. Oper. Res., 2005

A new super-memory gradient method with curve search rule.

Zhen-Jun Shi, Jie Shen

Appl. Math. Comput., 2005

Convergence of descent method without line search.

Zhen-Jun Shi, Jie Shen

Appl. Math. Comput., 2005

A new descent algorithm with curve search rule.

Zhen-Jun Shi, Jie Shen

Appl. Math. Comput., 2005

2004

Convergence of line search methods for unconstrained optimization.

Zhen-Jun Shi

Appl. Math. Comput., 2004