<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05658710</id>
  <dt>j</dt>
  <an>05658710</an>
  <augroup>
    <au>Shen, Chungen</au>
    <au>Xue, Wenjuan</au>
    <au>Pu, Dingguo</au>
  </augroup>
  <ti>A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming.</ti>
  <so>Int. J. Comput. Math. 86, No. 12, 2201-2217 (2009).</so>
  <py>2009</py>
  <pu>Taylor \& Francis, Abingdon</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>trust region</ut>
    <ut>multidimensional filter</ut>
    <ut>SQP</ut>
    <ut>KKT point</ut>
    <ut>nonlinear programming</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1080/00207160802702400</li>
  </ligroup>
  <abgroup>
    <ab>A trust-region multidimensional filter method for solving nonlinear constrained optimization problem with equation and inequality constraints is proposed. In order to obtain a better numerical performance, the constraints are partitioned in $p$ parts so that one may set different parameters for different parts of constraints correspondingly. Another important feature of the algorithm is that the entries in the filter are independent of the objective function. Besides, the algorithm uses the non-monotonic technique for accepting trial steps, which increases the flexibility of acceptance criteria. Global convergence of the proposed algorithm under mild conditions is proved. Numerical results presented in the last section of the paper confirm the robustness of the proposed approach.</ab>
    <rv>Karel Zimmermann (Praha)</rv>
  </abgroup>
</item>