Inexactly constrained discrete adjoint approach for steepest descent-based optimization algorithms
From MaRDI portal
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.
Recommendations
- Effect of inexact adjoint solutions on the discrete-adjoint approach to gradient-based optimization
- Adaptive multilevel inexact SQP methods for PDE-constrained optimization
- On constrained optimization by adjoint based quasi-Newton methods
- Inexact Newton-type optimization with iterated sensitivities
- Adjoint formulation and constraint handling for gradient-based optimization of compositional reservoir flow
Cites work
- An introduction to the adjoint approach to design
- Fundamental algorithms in computational fluid dynamics
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 40971 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- On optimum design in fluid mechanics
Cited in
(3)
This page was built for publication: Inexactly constrained discrete adjoint approach for steepest descent-based optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652805)
