The validity of the ``pool-adjacent-violator'' algorithm (Q1096277): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-7152(88)90109-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988509725 / rank | |||
Normal rank | |||
Revision as of 22:17, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The validity of the ``pool-adjacent-violator'' algorithm |
scientific article |
Statements
The validity of the ``pool-adjacent-violator'' algorithm (English)
0 references
1988
0 references
The purpose of this paper is to show that if G is a positive definite symmetric real matrix, the solution to minimize \((g-x)'G(g-x)\) subject to \(x'A\geq 0\) can be determined through the pool-adjacent-violator (PAV) algorithm if and only if the restrictions cone, \(\hat A,\) is acute. We also show that such a solution can be determined in one step if and only if \(\hat A\) is right-angled. In the problem of isotonic regression \(\hat A\) is acute.
0 references
isotonic regression
0 references
maximum likelihood estimation
0 references
convex cone
0 references
pool- adjacent-violator (PAV) algorithm
0 references
right-angled
0 references
acute
0 references
