Metraipolis › archive › dc_c2447da04af5

Descent direction — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Descent_direction
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T12:19:14.291Z
SHA-256 of the archived text
74ceef65ba71f82c9ec7bd6355463564af0b6cb3cdbd5dc3c23b163e4f9c8831
Stable URL of this page
https://metraipolis.com/documento/dc_c2447da04af5

How to cite

Descent direction — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Descent_direction (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_c2447da04af5 (Metraipolis archive dc_c2447da04af5, sha256 74ceef65ba71f82c9ec7bd6355463564af0b6cb3cdbd5dc3c23b163e4f9c8831)
BibTeX
@misc{dcc2447da04af5,
  title = {Descent direction — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Descent_direction},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_c2447da04af5; sha256 74ceef65ba71f82c9ec7bd6355463564af0b6cb3cdbd5dc3c23b163e4f9c8831},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Descent_direction. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In optimization, a descent direction is a vector p ∈ R n {\displaystyle \mathbf {p} \in \mathbb {R} ^{n}} that points towards a local minimum x ∗ {\displaystyle \mathbf {x} ^{*}} of an objective function f : R n → R {\displaystyle f:\mathbb {R} ^{n}\to \mathbb {R} } . Computing x ∗ {\displaystyle \mathbf {x} ^{*}} by an iterative method, such as line search defines a descent direction p k ∈ R n {\displaystyle \mathbf {p} _{k}\in \mathbb {R} ^{n}} at the k {\displaystyle k} th iterate to be any p k {\displaystyle \mathbf {p} _{k}} such that ⟨ p k , ∇ f ( x k ) ⟩ < 0 {\displaystyle \langle \mathbf {p} _{k},\nabla f(\mathbf {x} _{k})\rangle <0} , where ⟨ , ⟩ {\displaystyle \langle ,\rangle } denotes the inner product. The motivation for such an approach is that small steps along p k {\displaystyle \mathbf {p} _{k}} guarantee that f {\displaystyle \displaystyle f} is reduced, by Taylor's theorem. Using this definition, the negative of a non-zero gradient is always a descent direction, as ⟨ − ∇ f ( x k ) , ∇ f ( x k ) ⟩ = − ⟨ ∇ f ( x k ) , ∇ f ( x k ) ⟩ < 0 {\displaystyle \langle -\nabla f(\mathbf {x} _{k}),\nabla f(\mathbf {x} _{k})\rangle =-\langle \nabla f(\mathbf {x} _{k}),\nabla f(\mathbf {x} _{k})\rangle <0} . Numerous methods exist to compute descent directions, all with differing merits, such as gradient descent or the conjugate gradient method. More generally, if P {\displaystyle P} is a positive definite matrix, then p k = − P ∇ f ( x k ) {\displaystyle p_{k}=-P\nabla f(x_{k})} is a descent direction at x k {\displaystyle x_{k}} . This generality is used in preconditioned gradient descent methods.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Mathematical optimization»).
Fonte: Wikipedia in inglese, voce «Descent direction» — https://en.wikipedia.org/wiki/Descent_direction
Wikidata Q2070951 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2070951
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Descent_direction?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1365995110, consultata il 2026-10-06T10:35:02.405Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 3d700c626c12239968c445a82a35963f097443321961a6970c271554fbc99e62