An efficient logarithmic barrier method without line search for convex quadratic programming (Q5882851)
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 efficient logarithmic barrier method without line search for convex quadratic programming |
scientific article; zbMATH DE number 7668672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient logarithmic barrier method without line search for convex quadratic programming |
scientific article; zbMATH DE number 7668672 |
Statements
An efficient logarithmic barrier method without line search for convex quadratic programming (English)
0 references
29 March 2023
0 references
quadratic programming
0 references
linear programming
0 references
interior point methods
0 references
line search
0 references
approximate function
0 references
0 references
0 references
