Metraipolis › archive › dc_04a38acbd994

Wolfe conditions — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Wolfe_conditions
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T15:32:07.768Z
SHA-256 of the archived text
ed5796dd5f194eb09258b7f29e687e9efc40eb4896f71967029b0a4d9e8324e8
Stable URL of this page
https://metraipolis.com/documento/dc_04a38acbd994

How to cite

Wolfe conditions — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Wolfe_conditions (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_04a38acbd994 (Metraipolis archive dc_04a38acbd994, sha256 ed5796dd5f194eb09258b7f29e687e9efc40eb4896f71967029b0a4d9e8324e8)
BibTeX
@misc{dc04a38acbd994,
  title = {Wolfe conditions — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Wolfe_conditions},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_04a38acbd994; sha256 ed5796dd5f194eb09258b7f29e687e9efc40eb4896f71967029b0a4d9e8324e8},
  year = {2026}
}

Archived text

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

In the unconstrained minimization problem, the Wolfe conditions (also known as the Armijo-Wolfe conditions in some books) are a set of inequalities for performing inexact line search, especially in quasi-Newton methods, first published by Philip Wolfe in 1969 (also named after Larry Armijo). In these methods the idea is to find min x f ( x ) {\displaystyle \min _{x}f(\mathbf {x} )} for some smooth f : R n → R {\displaystyle f\colon \mathbb {R} ^{n}\to \mathbb {R} } . Each step often involves approximately solving the subproblem min α f ( x k + α p k ) {\displaystyle \min _{\alpha }f(\mathbf {x} _{k}+\alpha \mathbf {p} _{k})} where x k {\displaystyle \mathbf {x} _{k}} is the current best guess, p k ∈ R n {\displaystyle \mathbf {p} _{k}\in \mathbb {R} ^{n}} is a search direction, and α ∈ R {\displaystyle \alpha \in \mathbb {R} } is the step length. The inexact line searches provide an efficient way of computing an acceptable step length α {\displaystyle \alpha } that reduces the objective function 'sufficiently', rather than minimizing the objective function over α ∈ R + {\displaystyle \alpha \in \mathbb {R} ^{+}} exactly. A line search algorithm can use Wolfe conditions as a requirement for any guessed α {\displaystyle \alpha } , before finding a new search direction p k {\displaystyle \mathbf {p} _{k}} .

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Mathematical optimization»).
Fonte: Wikipedia in inglese, voce «Wolfe conditions» — https://en.wikipedia.org/wiki/Wolfe_conditions
Wikidata Q3002999 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3002999
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Wolfe_conditions?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 1332746684, consultata il 2026-10-07T15:04:06.900Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 60b913417c24c9eee7aa66012155dbe9d6878cd4061dad831c86410540741349