A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming (Q4012423): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1137/0801017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083575507 / rank | |||
Normal rank | |||
Latest revision as of 19:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming |
scientific article |
Statements
A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming (English)
0 references
27 September 1992
0 references
Newton's method
0 references
interior point method
0 references
quadratically constrained convex quadratic programming
0 references
logarithmic barrier function
0 references
approximate solution
0 references
polynomial time
0 references
