Wei Zengxin

Zengxin Wei

Information about the author Zengxin Wei will soon be added to the site.
Found 7 papers in total
A modified Polak‐Ribière‐Polyak conjugate gradient algorithm for nonsmooth convex programs
A modified Polak‐Ribière‐Polyak conjugate gradient algorithm for nonsmooth convex programs
2014
The conjugate gradient (CG) method is one of the most popular methods for solving...
Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
2013
By means of a gradient strategy, the Moreau‐Yosida regularization, limited...
A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
2012
By using the Moreau‐Yosida regularization and proximal method, a new trust...
Convergence analysis of a modified BFGS method on convex minimizations
Convergence analysis of a modified BFGS method on convex minimizations
2010
A modified Broyden–Fletcher–Goldfarb–Shanno (BFGS) method is proposed for...
A trust-region-based BFGS method with line search technique for symmetric nonlinear equations
A trust-region-based BFGS method with line search technique for symmetric nonlinear equations
2009
A trust-region-based BFGS (Broyden–Fletcher–Goldfarb–Shanno) method is proposed for...
A variant of sequential quadratic programming method for inequality constrained optimization and its global convergence
A variant of sequential quadratic programming method for inequality constrained optimization and its global convergence
2006
In this paper, a variant of SQP method for solving inequality constrained optimization...
A manufacturing supply chain optimization model for distilling process
A manufacturing supply chain optimization model for distilling process
2005
In this paper, the model of an integrated manufacturing supply chain where multiple...
Papers per page: