A primal-dual infeasible interior point algorithm for a convex quadratic programming problem with box constraints (Q2756554)
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: A primal-dual infeasible interior point algorithm for a convex quadratic programming problem with box constraints |
scientific article; zbMATH DE number 1673418
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A primal-dual infeasible interior point algorithm for a convex quadratic programming problem with box constraints |
scientific article; zbMATH DE number 1673418 |
Statements
14 November 2001
0 references
primal-dual infeasible interior point algorithm
0 references
convex quadratic programming problem
0 references
A primal-dual infeasible interior point algorithm for a convex quadratic programming problem with box constraints (English)
0 references
0.8534806966781616
0 references
