Proving strong duality for geometric optimization using a conic formulation (Q5959331): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1013357600036 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1729600352 / rank | |||
Normal rank | |||
Latest revision as of 09:01, 30 July 2024
scientific article; zbMATH DE number 1723352
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proving strong duality for geometric optimization using a conic formulation |
scientific article; zbMATH DE number 1723352 |
Statements
Proving strong duality for geometric optimization using a conic formulation (English)
0 references
26 March 2002
0 references
The author presents new simplified proofs of the duality theorems of geometric programming using a conic formulation. Section 2 introduces convex cones and conic optimization problem and presefts the properties of the convex cones introduced. In section 3 the author presents a conic formulation of the geometric programming problem. Section 4 presents proofs of the duality results valid for the geometric programming problem, based on the results proved in section 2. Section 5 contains the concluding remarks.
0 references
geometric optimizaion
0 references
duality theory
0 references
conic optimization
0 references
