Zhenjun Shi

From MaRDI portal
Person:815994

Available identifiers

zbMath Open shi.zhenjunMaRDI QIDQ815994

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q58669042022-09-22Paper
https://portal.mardi4nfdi.de/entity/Q50626692022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50627392022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50629512022-03-17Paper
A Hessian-free Newton-Raphson method for the configuration of physics systems featured by numerically asymmetric force field2021-02-19Paper
Convergence analysis of adaptive trust region methods2018-01-12Paper
https://portal.mardi4nfdi.de/entity/Q49283582013-06-11Paper
Step-size estimation for unconstrained optimization methods2011-05-30Paper
Modified nonmonotone Armijo line search for descent method2011-05-11Paper
Nonmonotone adaptive trust region method2011-01-28Paper
The convergence of conjugate gradient method with nonmonotone line search2010-11-18Paper
The convergence of subspace trust region methods2009-07-17Paper
A new trust region method with adaptive radius2009-07-13Paper
A new memory gradient method under exact line search2009-05-22Paper
Global convergence of conjugate gradient method2009-04-23Paper
A new family of conjugate gradient methods2009-01-27Paper
A new algorithm of nonlinear conjugate gradient method with strong convergence2008-12-11Paper
Convergence of PRP method with new nonmonotone line search2008-09-12Paper
Convergence of memory gradient methods2008-08-08Paper
A new trust region method for unconstrained optimization2008-03-26Paper
Memory gradient method with Goldstein line search2008-02-11Paper
Some extensions of the trust region method2008-02-05Paper
A new projection-type alternating direction method for variational inequality problems2007-11-08Paper
Convergence of supermemory gradient method2007-10-22Paper
Convergence of Liu-Storey conjugate gradient method2007-05-30Paper
Convergence of the Polak-Ribiére-Polyak conjugate gradient method2007-03-09Paper
A new class of supermemory gradient methods2007-02-19Paper
New inexact line search method for unconstrained optimization2006-11-06Paper
Global convergence of a modified gradient projection method for convex constrained problems2006-10-24Paper
Convergence of subspace gradient method2006-07-14Paper
Convergence of nonmonotone line search method2006-06-16Paper
A diagonal-sparse quasi-Newton method for unconstrained optimization problem2006-06-15Paper
On memory gradient method with trust region for unconstrained optimization2006-06-14Paper
https://portal.mardi4nfdi.de/entity/Q54682892006-05-24Paper
On step-size estimation of line search methods2006-05-16Paper
NON-INTERIOR CONTINUATION METHOD FOR COMPLEMENTARITY PROBLEMS IN ABSENCE OF STRICT COMPLEMENTARITY2006-04-06Paper
Convergence of quasi-Newton method with new inexact line search2006-03-22Paper
Convergence of descent method with new line search2006-02-20Paper
https://portal.mardi4nfdi.de/entity/Q33721962006-02-20Paper
CONVERGENCE PROPERTY AND MODIFICATIONS OF A MEMORY GRADIENT METHOD2006-01-09Paper
A new super-memory gradient method with curve search rule2005-11-14Paper
Convergence of descent method without line search2005-10-28Paper
https://portal.mardi4nfdi.de/entity/Q56981282005-10-27Paper
https://portal.mardi4nfdi.de/entity/Q46726372005-05-03Paper
A new descent algorithm with curve search rule2005-02-22Paper
Convergence of line search methods for unconstrained optimization2004-10-14Paper
A gradient-related algorithm with inexact line searches2004-08-10Paper
https://portal.mardi4nfdi.de/entity/Q47835672003-09-04Paper
https://portal.mardi4nfdi.de/entity/Q44158582003-08-07Paper
https://portal.mardi4nfdi.de/entity/Q44161242003-08-07Paper
https://portal.mardi4nfdi.de/entity/Q45210912002-06-16Paper
A variation of Goldfarb's method for linearly constrained optimization problems and its superlinear convergence rate2001-07-11Paper
A maximum entropy method for constrained semi-infinite programming problems2001-07-11Paper
A supermemory gradient method for unconstrained optimization2001-06-27Paper
https://portal.mardi4nfdi.de/entity/Q42547822000-01-10Paper
https://portal.mardi4nfdi.de/entity/Q42673221999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42673301999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42673341999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42650641999-10-07Paper
https://portal.mardi4nfdi.de/entity/Q38405421998-08-10Paper
https://portal.mardi4nfdi.de/entity/Q43515921997-12-18Paper
https://portal.mardi4nfdi.de/entity/Q43364261997-09-16Paper
An algorithm for continuous type optimal location problem1997-07-17Paper
https://portal.mardi4nfdi.de/entity/Q48558461997-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43915801997-01-01Paper
https://portal.mardi4nfdi.de/entity/Q48943291996-11-20Paper
https://portal.mardi4nfdi.de/entity/Q47149691996-11-07Paper
https://portal.mardi4nfdi.de/entity/Q48704271996-09-16Paper
https://portal.mardi4nfdi.de/entity/Q48562841996-04-15Paper
https://portal.mardi4nfdi.de/entity/Q33528471991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33606671990-01-01Paper

Research outcomes over time

This page was built for person: Zhenjun Shi