168 results on '"Wei, Zengxin"'
Search Results
2. The global convergence of the Polak–Ribière–Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
3. An alternative three-dimensional subspace method based on conic model for unconstrained optimization
4. An alternative three-dimensional subspace method based on conic model for unconstrained optimization
5. Global convergence of BFGS and PRP methods under a modified weak Wolfe–Powell line search
6. A modified Polak–Ribière–Polyak conjugate gradient algorithm for nonsmooth convex programs
7. Convergence analysis on a modified generalized alternating direction method of multipliers
8. A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
9. Differentiable implicitly restarted Lanczos method for computing eigenpairs and their derivatives of large symmetric matrix-valued functions
10. An active-set projected trust region algorithm for box constrained optimization problems
11. Limited memory BFGS method with backtracking for symmetric nonlinear equations
12. Some global convergence properties of the Wei–Yao–Liu conjugate gradient method with inexact line search
13. Error bound results for generalized D-gap functions of nonsmooth variational inequality problems
14. New line search methods for unconstrained optimization
15. A conjugate gradient method with descent direction for unconstrained optimization
16. BFGS trust-region method for symmetric nonlinear equations
17. Globally convergent Polak–Ribière–Polyak conjugate gradient methods under a modified Wolfe line search
18. Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
19. A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
20. A BFGS trust-region method for nonlinear equations
21. A limited memory BFGS-type method for large-scale unconstrained optimization
22. The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions
23. The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization
24. Convergence analysis of a modified BFGS method on convex minimizations
25. The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems
26. On a Separation Principle for Nonconvex Sets
27. New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
28. A note about WYL’s conjugate gradient method and its applications
29. A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
30. A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
31. The Superlinear Convergence of a Modified BFGS-Type Method for Unconstrained Optimization
32. A class of nonmonotone conjugate gradient methods for nonconvex functions
33. A variant of SQP method for inequality constrained optimization and its global convergence
34. The convergence properties of some new conjugate gradient methods
35. New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
36. New quasi-Newton methods for unconstrained optimization problems
37. Convergence Analysis on an Accelerated Proximal Point Algorithm for Linearly Constrained Optimization Problems
38. A manufacturing supply chain optimization model for distilling process
39. A nonmonotone trust region method for unconstrained optimization
40. A new successive quadratic programming algorithm
41. Further study of multi-granulation fuzzy rough sets
42. A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
43. A Limited-Memory BFGS Algorithm Based on a Trust-Region Quadratic Model for Large-Scale Nonlinear Equations
44. An active-set projected trust region algorithm for box constrained optimization problems
45. Inexact Accelerated Proximal Gradient Algorithms For Matrix l_{2,1}-Norm Minimization Problem in Multi-Task Feature Learning
46. Wei–Yao–Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints
47. Portfolio selection model with higher moments risk
48. A Modified Non-Monotone BFGS Method for Non-Convex Unconstrained Optimization
49. A modified Polak–Ribière–Polyak conjugate gradient algorithm for large-scale optimization problems
50. 投资环境的决定因素与政府吸引外资工作 = The decisive factor to investment environment and the local government's work to draw foreign capital
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.