An efficient logarithmic barrier method without line search for convex quadratic programming (Q5882851): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:58, 5 March 2024
scientific article; zbMATH DE number 7668672
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
