The following pages link to Pu, Dingguo (Q161456):
Displayed 50 items.
- (Q216234) (redirect page) (← links)
- A nonmonotone filter trust region method for the system of nonlinear equations (Q345830) (← links)
- A restoration-free filter SQP algorithm for equality constrained optimization (Q371507) (← links)
- A tri-dimensional filter SQP algorithm for variational inequality problems (Q382458) (← links)
- Line search SQP method with a flexible step acceptance procedure (Q491490) (← links)
- Smoothing Levenberg-Marquardt method for general nonlinear complementarity problems under local error bound (Q534917) (← links)
- A kind of nonmonotone filter method for nonlinear complementarity problem (Q545563) (← links)
- A modified QP-free feasible method (Q552398) (← links)
- Sequential quadratic programming with a flexible step acceptance strategy (Q693514) (← links)
- A new double trust regions SQP method without a penalty function or a filter (Q712469) (← links)
- A line search filter algorithm with inexact step computations for equality constrained optimization (Q765270) (← links)
- On the convergence property of the DFP algorithm (Q803046) (← links)
- A new filter QP-free method for the nonlinear inequality constrained optimization problem (Q824828) (← links)
- A filter SQP algorithm without a feasibility restoration phase (Q843266) (← links)
- Piecewise linear NCP function for QP free feasible method (Q854563) (← links)
- A smoothing QP-free infeasible method for nonlinear inequality constrained optimization (Q933072) (← links)
- A nonmonotone filter trust region method for nonlinear constrained optimization (Q953386) (← links)
- Smoothing Newton method for NCP with the identification of degenerate indices (Q989148) (← links)
- Finding global minimizer with one-parameter filled function on unconstrained global optimization (Q990416) (← links)
- Global convergence of a tri-dimensional filter SQP algorithm based on the line search method (Q999072) (← links)
- A penalty-function-free line search SQP method for nonlinear programming (Q1019803) (← links)
- Inexact generalized Newton methods for second order \(C\)-differentiable optimization (Q1298488) (← links)
- The convergence of Broyden algorithms for LC gradient function (Q1582577) (← links)
- The revised DFP algorithm without exact line search (Q1811670) (← links)
- An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization (Q2342895) (← links)
- An infeasible nonmonotone SSLE algorithm for nonlinear programming (Q2379186) (← links)
- A class of revised Broyden algorithms (Q2471569) (← links)
- A feasible filter SQP algorithm with global and local convergence (Q2511102) (← links)
- A trust-region SQP method without a penalty or a filter for nonlinear programming (Q2515095) (← links)
- A line search SQP method without a penalty or a filter (Q2516801) (← links)
- (Q2858651) (← links)
- (Q2860081) (← links)
- (Q2886354) (← links)
- (Q2886390) (← links)
- (Q2924614) (← links)
- An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization (Q2926081) (← links)
- (Q2951355) (← links)
- (Q2993672) (← links)
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY (Q3013564) (← links)
- (Q3014469) (← links)
- (Q3052559) (← links)
- (Q3104030) (← links)
- (Q3109416) (← links)
- (Q3110450) (← links)
- (Q3147248) (← links)
- A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION (Q3148358) (← links)
- (Q3170361) (← links)
- (Q3365816) (← links)
- (Q3368058) (← links)
- (Q3405198) (← links)