Zengxin Wei
According to our database1,
Zengxin Wei
authored at least 41 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
1
1
1
2
3
2
2
1
4
4
4
2
6
3
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
An alternative three-dimensional subspace method based on conic model for unconstrained optimization.
RAIRO Oper. Res., January, 2024
2019
The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions.
J. Comput. Appl. Math., 2019
2017
2016
2015
An active-set projected trust region algorithm for box constrained optimization problems.
J. Syst. Sci. Complex., 2015
Wei-Yao-Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints.
Int. J. Comput. Math., 2015
2014
A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs.
J. Comput. Appl. Math., 2014
Asia Pac. J. Oper. Res., 2014
2013
A Conjugate Gradient Method with Global Convergence for Large-Scale Unconstrained Optimization Problems.
J. Appl. Math., 2013
Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization.
Comput. Optim. Appl., 2013
2012
A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization.
Comput. Optim. Appl., 2012
2011
Math. Comput. Model., 2011
A new trust-region method with line search for solving symmetric nonlinear equations.
Int. J. Comput. Math., 2011
Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search.
Appl. Math. Comput., 2011
2010
The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems.
J. Syst. Sci. Complex., 2010
Error bound results for generalized D-gap functions of nonsmooth variational inequality problems.
J. Comput. Appl. Math., 2010
Comput. Optim. Appl., 2010
2009
J. Comput. Appl. Math., 2009
A Rank-One Fitting Method with Descent Direction for Solving Symmetric Nonlinear Equations.
Int. J. Commun. Netw. Syst. Sci., 2009
Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search.
Appl. Math. Comput., 2009
A Trust-Region-Based BFGS Method with Line Search Technique for Symmetric Nonlinear Equations.
Adv. Oper. Res., 2009
2008
Comput. Math. Appl., 2008
The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization.
Appl. Math. Comput., 2008
2007
Optim. Methods Softw., 2007
A descent nonlinear conjugate gradient method for large-scale unconstrained optimization.
Appl. Math. Comput., 2007
A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization.
Appl. Math. Comput., 2007
Appl. Math. Comput., 2007
The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search.
Appl. Math. Comput., 2007
2006
Appl. Math. Comput., 2006
New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems.
Appl. Math. Comput., 2006
Appl. Math. Comput., 2006
2005
Appl. Math. Comput., 2005
Appl. Math. Comput., 2005
2004
The Superlinear Convergence of a Modified BFGS-Type Method for Unconstrained Optimization.
Comput. Optim. Appl., 2004
2001
Corrigendum: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods.
SIAM J. Optim., 2001
2000
On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods.
SIAM J. Optim., 2000