Calculus of variations and optimal control; optimization Numerical methods for optimal control Concept
Adjoint state method
Summary
The adjoint state method computes the gradient of an objective that depends on parameters through the solution of an equation. A typical example of such an equation is a discretised differential equation. Instead of differentiating the state with respect to each parameter, it solves one extra linear equation, the adjoint equation, whose solution is the adjoint state. The cost of the gradient is then about that of one or two state solves, whatever the number of parameters. It is the basis of PDE-constrained optimization, of seismic and medical inversion, and of reverse-mode differentiation.
Further reading
About this page
| Tag | YD8SA6WS01 |
|---|---|
| URI | m2://YD8SA6WS01 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 49M41, 65K10, 49K20 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.