An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02614382 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2032834460 / rank | |||
Normal rank | |||
Latest revision as of 08:59, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An infeasible interior-point algorithm for solving primal and dual geometric programs |
scientific article |
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
