An Efficient Algorithm for the Separable Nonlinear Least Squares Problem

The nonlinear least squares problem m i n y , z ∥ A ( y ) z + b ( y ) ∥ , where A ( y ) is a full-rank ( N + ℓ ) × N matrix, y ∈ R n , z ∈ R N and b ( y ) ∈ R N + ℓ with ℓ ≥ n , can be solved by first solving a reduced problem m i n y ∥ f ( y ) ∥ to find the optimal value y * of y, and then solving the resulting linear least squares problem m i n z ∥ A ( y * ) z + b ( y * ) ∥ to find the optimal value z * of z. We have previously justified the use of the reduced function f ( y ) = C T ( y ) b ( y ) , where C ( y ) is a matrix whose columns form an orthonormal basis for the nullspace of A T ( y ) , and presented a quadratically convergent Gauss–Newton type method for solving m i n y ∥ C T ( y ) b ( y ) ∥ based on the use of QR factorization. In this note, we show how LU factorization can replace the QR factorization in those computations, halving the associated computational cost while also providing opportunities to exploit sparsity and thus further enhance computational efficiency