An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: NETLIB LP Test Set / rank | |||
Normal rank | |||
Revision as of 02:05, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exterior point polynomial-time algorithm for convex quadratic programming |
scientific article |
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
