Metraipolis › archive › dc_25d613b9d9d2
Trust region — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Trust_region
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T22:55:01.071Z
- SHA-256 of the archived text
375c42e7da7027883702af573143452339bad3390917075e0a92aa877a8950df- Stable URL of this page
https://metraipolis.com/documento/dc_25d613b9d9d2
How to cite
Trust region — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Trust_region (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_25d613b9d9d2 (Metraipolis archive dc_25d613b9d9d2, sha256 375c42e7da7027883702af573143452339bad3390917075e0a92aa877a8950df)
BibTeX
@misc{dc25d613b9d9d2,
title = {Trust region — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Trust_region},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_25d613b9d9d2; sha256 375c42e7da7027883702af573143452339bad3390917075e0a92aa877a8950df},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Trust_region. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In mathematical optimization, a trust region is the subset of the region of the objective function that is approximated using a model function (often a quadratic). If an adequate model of the objective function is found within the trust region, then the region is expanded; conversely, if the approximation is poor, then the region is contracted. The fit is evaluated by comparing the ratio of expected improvement from the model approximation with the actual improvement observed in the objective function. Simple thresholding of the ratio is used as the criterion for expansion and contraction—a model function is "trusted" only in the region where it provides a reasonable approximation. Trust-region methods are in some sense dual to line-search methods: trust-region methods first choose a step size (the size of the trust region) and then a step direction, while line-search methods first choose a step direction and then a step size. The general idea behind trust region methods is known by many names; the earliest use of the term seems to be by Sorensen (1982). A popular textbook by Fletcher (1980) calls these algorithms restricted-step methods. Additionally, in an early foundational work on the method, Goldfeld, Quandt, and Trotter (1966) refer to it as quadratic hill-climbing. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «mathematical optimization»). Fonte: Wikipedia in inglese, voce «Trust region» — https://en.wikipedia.org/wiki/Trust_region Wikidata Q1535924 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1535924 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Trust_region?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 1328147355, consultata il 2026-10-07T22:31:42.485Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: fbc87ebcd5cb02ea72ac25336e209f6453f350f23d9e597569ea968cea738b21