An inner approximation method incorporating with a penalty function method for a reverse convex programming problem (Q697546)
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 inner approximation method incorporating with a penalty function method for a reverse convex programming problem |
scientific article; zbMATH DE number 1801718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An inner approximation method incorporating with a penalty function method for a reverse convex programming problem |
scientific article; zbMATH DE number 1801718 |
Statements
An inner approximation method incorporating with a penalty function method for a reverse convex programming problem (English)
0 references
17 September 2002
0 references
The inner approximation algorithm previously proposed by the authors [J. Optimization Theory Appl. 107, No. 2, 355-389 (2000; Zbl 0997.90076)] for solving the reverse convex programming problem is improved. The global convergence of the algorithm is established by underestimating the optimal value of the relaxed problem. Some computational results are presented.
0 references
global optimization
0 references
reverse convex programming problem
0 references
dual problem
0 references
inner approximation method
0 references
penalty function method
0 references
numerical examples
0 references
global convergence
0 references
0.93974054
0 references
0.8906342
0 references
0.8898344
0 references
0 references
0.88079894
0 references
0.88060486
0 references
0.8795948
0 references
0.8791387
0 references
