The following pages link to Zeng-xin Wei (Q385194):
Displayed 50 items.
- (Q295479) (redirect page) (← links)
- (Q1372546) (redirect page) (← links)
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
- Global convergence of a modified limited memory BFGS method for non-convex minimization (Q385195) (← links)
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
- Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search (Q531627) (← links)
- A trust-region-based BFGS method with line search technique for symmetric nonlinear equations (Q606189) (← links)
- The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems (Q625664) (← links)
- Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← links)
- A BFGS trust-region method for nonlinear equations (Q644875) (← links)
- Limited memory BFGS method with backtracking for symmetric nonlinear equations (Q646097) (← links)
- A class of nonmonotone conjugate gradient methods for nonconvex functions (Q698383) (← links)
- Convergence analysis of a modified BFGS method on convex minimizations (Q711385) (← links)
- A conjugate gradient method with descent direction for unconstrained optimization (Q732160) (← links)
- A nonmonotone trust region method for unconstrained optimization (Q814729) (← links)
- A manufacturing supply chain optimization model for distilling process (Q814740) (← links)
- Convergence analysis on a modified generalized alternating direction method of multipliers (Q824590) (← links)
- Error bound results for generalized D-gap functions of nonsmooth variational inequality problems (Q848535) (← links)
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems (Q849738) (← links)
- The convergence properties of some new conjugate gradient methods (Q865594) (← links)
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q870176) (← links)
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization (Q875393) (← links)
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization (Q883860) (← links)
- An active-set projected trust region algorithm for box constrained optimization problems (Q905153) (← links)
- (Q928231) (redirect page) (← links)
- The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions (Q928232) (← links)
- The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions (Q939545) (← links)
- A note about WYL's conjugate gradient method and its applications (Q990447) (← links)
- A limited memory BFGS-type method for large-scale unconstrained optimization (Q1004767) (← links)
- On a separation principle for nonconvex sets (Q1005836) (← links)
- BFGS trust-region method for symmetric nonlinear equations (Q1026429) (← links)
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← links)
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search (Q1049322) (← links)
- A new successive quadratic programming algorithm (Q1210225) (← links)
- Some convergence properties of descent methods (Q1372548) (← links)
- The superlinear convergence of a modified BFGS-type method for unconstrained optimization (Q1771221) (← links)
- A network simplex algorithm for simple manufacturing network model (Q1780135) (← links)
- A conjugate gradient method with global convergence for large-scale unconstrained optimization problems (Q1790099) (← links)
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization (Q1938913) (← links)
- Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems (Q2214872) (← links)
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search (Q2290291) (← links)
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions (Q2315883) (← links)
- A new version of the Liu-Storey conjugate gradient method (Q2381321) (← links)
- The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search (Q2383633) (← links)
- A variant of SQP method for inequality constrained optimization and its global convergence (Q2432728) (← links)
- The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization (Q2479147) (← links)
- New quasi-Newton methods for unconstrained optimization problems (Q2493696) (← links)
- New line search methods for unconstrained optimization (Q2510603) (← links)
- Corrigendum: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods (Q2719245) (← links)
- Wei–Yao–Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints (Q2804026) (← links)