New infeasible interior-point algorithm based on monomial method (Q1919774)
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: New infeasible interior-point algorithm based on monomial method |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New infeasible interior-point algorithm based on monomial method |
scientific article |
Statements
New infeasible interior-point algorithm based on monomial method (English)
0 references
19 January 1997
0 references
infeasible path-following algorithm
0 references
convex linearly-constrained quadratic programming
0 references
continuous quadratic knapsack problems
0 references
0 references
0 references
