Steplengths in interior-point algorithms of quadratic programming (Q1306349)
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: Steplengths in interior-point algorithms of quadratic programming |
scientific article; zbMATH DE number 1347052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Steplengths in interior-point algorithms of quadratic programming |
scientific article; zbMATH DE number 1347052 |
Statements
Steplengths in interior-point algorithms of quadratic programming (English)
0 references
9 February 2001
0 references
infeasible-interior-point primal-dual method
0 references
convex quadratic problems
0 references
efficient set
0 references
multiobjective optimization
0 references
0 references
0 references
0 references
0.9137702584266664
0 references
0.7873726487159729
0 references
0.7826176285743713
0 references
0.7800602316856384
0 references
