A Compact Algorithm for Computing the Stationary Point of a Quadratic Function Subject to Linear Constraints (Q3873415): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/355900.355911 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016344536 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Compact Algorithm for Computing the Stationary Point of a Quadratic Function Subject to Linear Constraints |
scientific article |
Statements
A Compact Algorithm for Computing the Stationary Point of a Quadratic Function Subject to Linear Constraints (English)
0 references
1980
0 references
algorithm
0 references
Householder
0 references
Hessian matrices
0 references
quadratic programming
0 references
orthogonal decomposition
0 references
