<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05858673</id>
  <dt>j</dt>
  <an>05858673</an>
  <augroup>
    <au>Bellavia, S.</au>
    <au>Cartis, C.</au>
    <au>Gould, N.I.M.</au>
    <au>Morini, B.</au>
    <au>Toint, Ph.L.</au>
  </augroup>
  <ti>Convergence of a regularized Euclidean residual algorithm for nonlinear least-squares.</ti>
  <so>SIAM J. Numer. Anal. 48, No. 1, 1-29 (2010).</so>
  <py>2010</py>
  <pu>Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>regularized Euclidean residual algorithm</ut>
    <ut>nonlinear least-squares</ut>
    <ut>the Gauss-Newton algorithm</ut>
    <ut>global convergence</ut>
    <ut>first-order critical points</ut>
  </utgroup>
  <cigroup>
    <ci>Zbl 1136.65051</ci>
  </cigroup>
  <ligroup>
    <li>doi:10.1137/080732432</li>
  </ligroup>
  <abgroup>
    <ab>Authors' abstract: ``The convergence properties of the new regularized Euclidean residual method for solving general nonlinear least-squares and nonlinear equation problems are investigated. This method, derived from a proposal by {\it Yu. Nesterov} [Optim. Methods Softw. 22, No. 3, 469--483 (2007; Zbl 1136.65051)], uses a model of the objective function consisting of the unsquared Euclidean linearized residual regularized by a quadratic term. At variance with previous analysis, its convergence properties are here considered without assuming uniformly nonsingular globally Lipschitz continuous Jacobians nor an exact subproblem solution. It is proved that the method is globally convergent to first-order critical points and, under stronger assumptions, to roots of the underlying system of nonlinear equations. The rate of convergence is also shown to be quadratic under stronger assumptions.''</ab>
    <rv>Do Van Luu (Hanoi)</rv>
  </abgroup>
</item>