An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109)
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: An infeasible interior-point algorithm for solving primal and dual geometric programs |
scientific article; zbMATH DE number 1038507
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An infeasible interior-point algorithm for solving primal and dual geometric programs |
scientific article; zbMATH DE number 1038507 |
Statements
An infeasible interior-point algorithm for solving primal and dual geometric programs (English)
0 references
23 July 1997
0 references
convex analysis
0 references
infeasible primal-dual algorithm
0 references
duality
0 references
numerical implementation
0 references
subfeasible solutions
0 references
posynomial geometric programming
0 references
sparse matrix factorizations
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.95593977
0 references
0.9396943
0 references
0.9392778
0 references
0.9351752
0 references
0.9350637
0 references
0.9350636
0 references
0.93226916
0 references
