<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05735028</id>
  <dt>j</dt>
  <an>05735028</an>
  <augroup>
    <au>El-Alem, Mahmoud</au>
    <au>El-Sobky, Bothina</au>
    <au>El-Aziz, Mohammadi Abd</au>
  </augroup>
  <ti>Extending Goodman's method to general nonlinear programming.</ti>
  <so>Bull. Pure Appl. Math. 3, No. 2, 135-141 (2009).</so>
  <py>2009</py>
  <pu>Scientific Publishers, Jodhpur, Rajasthan, India</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>constrained optimization</ut>
    <ut>Goodman's method</ut>
    <ut>projected Hessian</ut>
    <ut>nonlinear programming</ut>
  </utgroup>
  <cigroup>
    <ci>Zbl 0589.90065</ci>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: A new algorithm for solving the general nonlinear programming problem is introduced. The algorithm uses the Coleman-Li scaling matrix together with a formulation for Newton's interior point method and can be viewed as a generalization of {\it J. Goodman}'s method [Math. Program. 33, 162--171 (1985; Zbl 0589.90065)] to general nonlinear programming.</ab>
    <rv></rv>
  </abgroup>
</item>