Hierarchical gradient methods for nonlinear LSQ problems
type: Item
instance of: scholarly article
title: Hierarchical gradient methods for nonlinear LSQ problems
zbMATH Open document ID: 0781.65050
DOI: 10.1007/BF01061328
author: M. F. Berger
published in: Journal of Scientific Computing
publication date: 1993-08-29T00:00:00Z
review text: The author proposes a variant of the gradient algorithm that consists in a succession of cycles. On an iteration of the cycle, only a subset of the variables is changed; all variables must have changed at the end of a cycle. He applies his idea to nonlinear least squares problems.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 399279
zbMATH Keywords: global convergence
zbMATH Keywords: decomposition
zbMATH Keywords: hierarchical optimization
zbMATH Keywords: gradient algorithm
zbMATH Keywords: nonlinear least squares problems
reviewed by: J. Frédéric Bonnans
MaRDI profile type: Publication
cites work: Elimination with weighted row combinations for solving linear equations and least squares problems
cites work: Q3742593
cites work: Q3220061
cites work: Q5685872
cites work: Optimal control of linear and nonlinear systems having distributed parameters
cites work: Q5602556
cites work: Parameter estimation in large-scale systems using sequential decomposition
full work available at URL: https://doi.org/10.1007/bf01061328
OpenAlex ID: W2038106742
description: scientific article; zbMATH DE number 399279