An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489)
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 exterior point polynomial-time algorithm for convex quadratic programming |
scientific article; zbMATH DE number 6427294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exterior point polynomial-time algorithm for convex quadratic programming |
scientific article; zbMATH DE number 6427294 |
Statements
An exterior point polynomial-time algorithm for convex quadratic programming (English)
0 references
20 April 2015
0 references
self-concordant function
0 references
polynomial-time algorithm
0 references
exterior point
0 references
path-following
0 references
convex quadratic programming
0 references
regularization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8532370924949646
0 references
0.831356942653656
0 references
0.8283351063728333
0 references
0.8270822167396545
0 references
