default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZengxin Wei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j40]Gonglin Yuan
, Zengxin Wei, Yuning Yang:
The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions. J. Comput. Appl. Math. 362: 262-275 (2019)- 2017
- [j39]Qingzhao Kong, Zengxin Wei:
Further study of multi-granulation fuzzy rough sets. J. Intell. Fuzzy Syst. 32(3): 2413-2424 (2017) - 2016
- [j38]Qingzhao Kong, Zengxin Wei:
多粒化的粗糙集代数 (Rough Set Algebra of Multi-granulation). 计算机科学 43(2): 68-71 (2016) - [j37]Qingzhao Kong, Zengxin Wei:
多粒化的模糊粗糙集代数 (Fuzzy Rough Set Algebra of Multi-granulation). 计算机科学 43(4): 206-209 (2016) - 2015
- [j36]Yaping Hu, Zengxin Wei:
Wei-Yao-Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints. Int. J. Comput. Math. 92(11): 2261-2272 (2015) - [j35]Qingzhao Kong, Zengxin Wei:
Covering-based fuzzy rough sets. J. Intell. Fuzzy Syst. 29(6): 2405-2411 (2015) - [j34]Gonglin Yuan, Zengxin Wei, Maojun Zhang:
An active-set projected trust region algorithm for box constrained optimization problems. J. Syst. Sci. Complex. 28(5): 1128-1147 (2015) - 2014
- [j33]Liying Liu, Shengwei Yao, Zengxin Wei:
A Modified Non-Monotone BFGS Method for Non-Convex Unconstrained Optimization. Asia Pac. J. Oper. Res. 31(5) (2014) - [j32]Gonglin Yuan, Zengxin Wei, Guoyin Li:
A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs. J. Comput. Appl. Math. 255: 86-96 (2014) - 2013
- [j31]Gonglin Yuan, Zengxin Wei, Zhongxing Wang:
Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization. Comput. Optim. Appl. 54(1): 45-64 (2013) - [j30]Shengwei Yao, Xiwen Lu, Zengxin Wei:
A Conjugate Gradient Method with Global Convergence for Large-Scale Unconstrained Optimization Problems. J. Appl. Math. 2013: 730454:1-730454:9 (2013) - 2012
- [j29]Sha Lu, Zengxin Wei, Lue Li:
A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization. Comput. Optim. Appl. 51(2): 551-573 (2012) - 2011
- [j28]Sha Lu, Zengxin Wei, Liliu Mo:
Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search. Appl. Math. Comput. 217(17): 7132-7137 (2011) - [j27]Gonglin Yuan, Zengxin Wei, Xiwen Lu:
A BFGS trust-region method for nonlinear equations. Computing 92(4): 317-333 (2011) - [j26]Gonglin Yuan, Sha Lu, Zengxin Wei:
A new trust-region method with line search for solving symmetric nonlinear equations. Int. J. Comput. Math. 88(10): 2109-2123 (2011) - [j25]Gonglin Yuan, Zengxin Wei, Sha Lu:
Limited memory BFGS method with backtracking for symmetric nonlinear equations. Math. Comput. Model. 54(1-2): 367-377 (2011) - 2010
- [j24]Gonglin Yuan, Zengxin Wei:
Convergence analysis of a modified BFGS method on convex minimizations. Comput. Optim. Appl. 47(2): 237-255 (2010) - [j23]Guoyin Li, Chun-Ming Tang, Zengxin Wei:
Error bound results for generalized D-gap functions of nonsmooth variational inequality problems. J. Comput. Appl. Math. 233(11): 2795-2806 (2010) - [j22]Liying Liu, Zengxin Wei, Xiaoping Wu:
The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems. J. Syst. Sci. Complex. 23(4): 861-872 (2010) - [j21]Gonglin Yuan, Sha Lu, Zengxin Wei:
A Line Search Algorithm for Unconstrained Optimization. J. Softw. Eng. Appl. 3(5): 503-509 (2010) - 2009
- [j20]Gonglin Yuan, Shide Meng, Zengxin Wei:
A Trust-Region-Based BFGS Method with Line Search Technique for Symmetric Nonlinear Equations. Adv. Oper. Res. 2009: 909753:1-909753:22 (2009) - [j19]Gaohang Yu, Lutai Guan, Zengxin Wei:
Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search. Appl. Math. Comput. 215(8): 3082-3090 (2009) - [j18]Gonglin Yuan, Zhongxing Wang, Zengxin Wei:
A Rank-One Fitting Method with Descent Direction for Solving Symmetric Nonlinear Equations. Int. J. Commun. Netw. Syst. Sci. 2(6): 555-561 (2009) - [j17]Gonglin Yuan, Xiwen Lu, Zengxin Wei:
A conjugate gradient method with descent direction for unconstrained optimization. J. Comput. Appl. Math. 233(2): 519-530 (2009) - 2008
- [j16]Zengxin Wei, Liying Liu, Shengwei Yao:
The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization. Appl. Math. Comput. 196(2): 791-801 (2008) - [j15]Yunhai Xiao, Zengxin Wei, Zhiguo Wang:
A limited memory BFGS-type method for large-scale unconstrained optimization. Comput. Math. Appl. 56(4): 1001-1009 (2008) - 2007
- [j14]Yunhai Xiao, Zengxin Wei:
A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization. Appl. Math. Comput. 185(1): 350-359 (2007) - [j13]Gaohang Yu, Yanlin Zhao, Zengxin Wei:
A descent nonlinear conjugate gradient method for large-scale unconstrained optimization. Appl. Math. Comput. 187(2): 636-643 (2007) - [j12]Chun-Ming Tang, Zengxin Wei, Guoyin Li:
A new version of the Liu-Storey conjugate gradient method. Appl. Math. Comput. 189(1): 302-313 (2007) - [j11]Hai Huang, Zengxin Wei, Shengwei Yao:
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. 189(2): 1241-1245 (2007) - [j10]Shengwei Yao, Zengxin Wei, Hai Huang:
A note about WYL's conjugate gradient method and its applications. Appl. Math. Comput. 191(2): 381-388 (2007) - [j9]Jiangtao Mo, Nengzhu Gu, Zengxin Wei:
Hybrid conjugate gradient methods for unconstrained optimization. Optim. Methods Softw. 22(2): 297-307 (2007) - 2006
- [j8]Zengxin Wei, Guoyin Li, Liqun Qi:
New quasi-Newton methods for unconstrained optimization problems. Appl. Math. Comput. 175(2): 1156-1188 (2006) - [j7]Zengxin Wei, Guoyin Li, Liqun Qi:
New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems. Appl. Math. Comput. 179(2): 407-430 (2006) - [j6]Zengxin Wei, Shengwei Yao, Liying Liu:
The convergence properties of some new conjugate gradient methods. Appl. Math. Comput. 183(2): 1341-1350 (2006) - 2005
- [j5]Jiangtao Mo, Kecun Zhang, Zengxin Wei:
A nonmonotone trust region method for unconstrained optimization. Appl. Math. Comput. 171(1): 371-384 (2005) - [j4]Jiangtao Mo, Liqun Qi, Zengxin Wei:
A manufacturing supply chain optimization model for distilling process. Appl. Math. Comput. 171(1): 464-485 (2005) - 2004
- [j3]Zengxin Wei, Gaohang Yu, Gonglin Yuan, Zhigang Lian:
The Superlinear Convergence of a Modified BFGS-Type Method for Unconstrained Optimization. Comput. Optim. Appl. 29(3): 315-332 (2004) - 2001
- [j2]Liqun Qi, Zengxin Wei:
Corrigendum: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods. SIAM J. Optim. 11(4): 1145-1146 (2001) - 2000
- [j1]Liqun Qi, Zengxin Wei:
On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods. SIAM J. Optim. 10(4): 963-981 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
