Finding a strict feasible dual solution of a convex optimization problem (Q258326)
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: Finding a strict feasible dual solution of a convex optimization problem |
scientific article; zbMATH DE number 6553161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a strict feasible dual solution of a convex optimization problem |
scientific article; zbMATH DE number 6553161 |
Statements
Finding a strict feasible dual solution of a convex optimization problem (English)
0 references
10 March 2016
0 references
quadratic programming
0 references
convex nonlinear programming
0 references
interior point methods
0 references
0 references
0.9145509
0 references
0.8978504
0 references
0.89535534
0 references
0.89173317
0 references
0.8916154
0 references
