The following pages link to Zhen-Jun Shi (Q815994):
Displaying 50 items.
- (Q535244) (redirect page) (← links)
- Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
- Step-size estimation for unconstrained optimization methods (Q539765) (← links)
- A gradient-related algorithm with inexact line searches (Q596214) (← links)
- The convergence of conjugate gradient method with nonmonotone line search (Q606706) (← links)
- Nonmonotone adaptive trust region method (Q621656) (← links)
- Convergence of descent method with new line search (Q815995) (← links)
- Convergence of quasi-Newton method with new inexact line search (Q819030) (← links)
- New inexact line search method for unconstrained optimization (Q850832) (← links)
- A new class of supermemory gradient methods (Q865511) (← links)
- Convergence of the Polak-Ribiére-Polyak conjugate gradient method (Q869834) (← links)
- Convergence of Liu-Storey conjugate gradient method (Q881512) (← links)
- Convergence of PRP method with new nonmonotone line search (Q945382) (← links)
- A new algorithm of nonlinear conjugate gradient method with strong convergence (Q959477) (← links)
- A new trust region method with adaptive radius (Q1029622) (← links)
- An algorithm for continuous type optimal location problem (Q1360248) (← links)
- A new descent algorithm with curve search rule (Q1764727) (← links)
- Convergence of line search methods for unconstrained optimization (Q1881700) (← links)
- A Hessian-free Newton-Raphson method for the configuration of physics systems featured by numerically asymmetric force field (Q2229103) (← links)
- The convergence of subspace trust region methods (Q2389569) (← links)
- Global convergence of a modified gradient projection method for convex constrained problems (Q2431943) (← links)
- Convergence of supermemory gradient method (Q2454990) (← links)
- Memory gradient method with Goldstein line search (Q2469911) (← links)
- A new trust region method for unconstrained optimization (Q2479356) (← links)
- On step-size estimation of line search methods (Q2489176) (← links)
- On memory gradient method with trust region for unconstrained optimization (Q2492798) (← links)
- Convergence of nonmonotone line search method (Q2493941) (← links)
- A new family of conjugate gradient methods (Q2519734) (← links)
- Convergence of descent method without line search (Q2570691) (← links)
- A new super-memory gradient method with curve search rule (Q2571993) (← links)
- (Q2720792) (← links)
- (Q2721842) (← links)
- (Q2721873) (← links)
- (Q3352847) (← links)
- (Q3360667) (← links)
- (Q3372196) (← links)
- NON-INTERIOR CONTINUATION METHOD FOR COMPLEMENTARITY PROBLEMS IN ABSENCE OF STRICT COMPLEMENTARITY (Q3379507) (← links)
- Convergence of memory gradient methods (Q3518551) (← links)
- Global convergence of conjugate gradient method (Q3622012) (← links)
- (Q3626416) (← links)
- (Q3840542) (← links)
- (Q4254782) (← links)
- (Q4265064) (← links)
- (Q4267322) (← links)
- (Q4267330) (← links)
- (Q4267334) (← links)
- (Q4336426) (← links)
- (Q4351592) (← links)
- (Q4391580) (← links)
- (Q4415858) (← links)
