The following pages link to Zhongwen Chen (Q250482):
Displayed 43 items.
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds (Q267115) (← links)
- A penalty-free method for equality constrained optimization (Q380463) (← links)
- A new penalty-free-type algorithm based on trust region techniques (Q387487) (← links)
- Global and local convergence of a penalty-free method for nonlinear programming (Q493442) (← links)
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming (Q693410) (← links)
- On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming (Q738946) (← links)
- A line search penalty-free method for nonlinear second-order cone programming (Q829562) (← links)
- (Q1411489) (redirect page) (← links)
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function (Q1411490) (← links)
- An interior point method for nonlinear optimization with a quasi-tangential subproblem (Q1689438) (← links)
- A penalty-free method with line search for nonlinear equality constrained optimization (Q1792357) (← links)
- A trust region algorithm for optimization with nonlinear equality and linear inequality constraints (Q1814847) (← links)
- A globally convergent trust region algorithm for optimization with general constraints and simple bounds. (Q1864225) (← links)
- A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization (Q1883470) (← links)
- A sensitivity result for quadratic second-order cone programming and its application. (Q2034051) (← links)
- A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming (Q2125656) (← links)
- A penalty-free method with superlinear convergence for equality constrained optimization (Q2191791) (← links)
- An adaptively regularized sequential quadratic programming method for equality constrained optimization (Q2244236) (← links)
- A line search exact penalty method for nonlinear semidefinite programming (Q2301144) (← links)
- A trust-region and affine scaling algorithm for linearly constrained optimization (Q2503848) (← links)
- Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization (Q3083522) (← links)
- (Q3132656) (← links)
- (Q3490872) (← links)
- (Q3490873) (← links)
- (Q3982455) (← links)
- (Q4010132) (← links)
- (Q4213859) (← links)
- (Q4271860) (← links)
- (Q4340238) (← links)
- (Q4483569) (← links)
- (Q4542294) (← links)
- An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming (Q4565262) (← links)
- Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems (Q4678767) (← links)
- An Augmented Lagrangian Trust Region Method with a Bi-object Strategy (Q4688177) (← links)
- (Q4808014) (← links)
- A central path interior point method for nonlinear programming and its local convergence (Q5028593) (← links)
- A line search penalty-free SQP method for equality-constrained optimization without Maratos effect (Q5042908) (← links)
- (Q5155917) (← links)
- A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming (Q5245841) (← links)
- (Q5497929) (← links)
- A line search exact penalty method with bi-object strategy for nonlinear constrained optimization (Q5964608) (← links)
- Solving Mathematical Programs with Equilibrium Constraints as Nonlinear Programming: A New Framework (Q6266734) (← links)
- A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming (Q6425926) (← links)