A subspace truncated-Newton algorithm for large-scale bound constrained optimization is proposed.

Uses a reduced-Newton algorithm with a weak line search to solve a set of non-linear algebraic equations.

The results showed that the practically mixed algorithm was better than simple GA or Gauss-Newton algorithm.