Dual form reduction in the atomic optimization method (Q2399760)
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 6764065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dual form reduction in the atomic optimization method |
scientific article; zbMATH DE number 6764065 |
Statements
Dual form reduction in the atomic optimization method (English)
0 references
24 August 2017
0 references
In this work, the author studies one dimensional non-convex optimization problems with polynomial objective function and polynomial matrix inequality constraints for which they construct linear relaxations. The dual problems to the linear relaxations are then investigated, namely certain transformation is provided which shows that such problems are compatible with the atomic optimization method. Some reduction of the number of atoms is also given. Numerous comments allow for better understanding of the author's approach which is supplied with worked examples.
0 references
one dimensional problem
0 references
dual problem
0 references
atomic optimization method
0 references
linear matrix inequality
0 references
0.832645058631897
0 references
0.8268436193466187
0 references
0.7187721729278564
0 references
0.7187720537185669
0 references
0.7137856483459473
0 references
