Inexactly constrained discrete adjoint approach for steepest descent-based optimization algorithms
type: Item
instance of: scholarly article
title: Inexactly constrained discrete adjoint approach for steepest descent-based optimization algorithms
zbMATH Open document ID: 1397.65086
author: David A. Brown
author: S. K. Nadarajah
published in: Numerical Algorithms
publication date: 2018-07-16T00:00:00Z
review text: Convergence properties of the inexactly constrained gradient-based discrete adjoint steepest descent optimization algorithm are studied. A relationship was derived between the error in the solution to the constraint equations and the resulting error in the gradient, and it is established analytically that it is possible to maintain the Q-convergence rate of an exact gradient-based algorithm by adapting the constraint equation error based on the norm of the gradient and the convergence rate.
reviewed by: Hans Benker
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65K15
zbMATH DE Number: 6904332
zbMATH Keywords: constrained optimization
zbMATH Keywords: steepest descen
zbMATH Keywords: radient
MaRDI profile type: Publication
full work available at URL: s11075-017-0409-7
OpenAlex ID: W2750611103
cites work: Q3690580
cites work: An introduction to the adjoint approach to design
cites work: Q3994335
cites work: Q5491447
cites work: Q5652137
cites work: On optimum design in fluid mechanics
cites work: Fundamental Algorithms in Computational Fluid Dynamics
DOI: 10.1007/S11075-017-0409-7
description: scientific article; zbMATH DE number 6904332