Infeasible interior-point algorithm based optimization method for geometric programming (Q2704889)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1579550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Infeasible interior-point algorithm based optimization method for geometric programming |
scientific article; zbMATH DE number 1579550 |
Statements
8 July 2001
0 references
interior point algorithm
0 references
path-following algorithm
0 references
posynomial primal and dual geometric programs
0 references
primal-dual infeasible algorithm
0 references
geometric programming
0 references
Infeasible interior-point algorithm based optimization method for geometric programming (English)
0 references
0.931329607963562
0 references
0.8702248334884644
0 references
0.8326627016067505
0 references
