An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints (Q3539793)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints |
scientific article |
Statements
An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints (English)
0 references
19 November 2008
0 references
interior-point algorithm
0 references
self-concordant barrier
0 references
trust-region subproblem
0 references
0 references
0.9423653
0 references
0.91923726
0 references
0.91737443
0 references
0.91690385
0 references
0.91467905
0 references
