
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.
Convex programming, numerical examples, Inner approximation method, Reverse convex programming problem, global optimization, dual problem, penalty function method, Applied Mathematics, Dual problem, Penalty function method, global convergence, Computational Mathematics, Numerical mathematical programming methods, inner approximation method, reverse convex programming problem, Global optimization
Convex programming, numerical examples, Inner approximation method, Reverse convex programming problem, global optimization, dual problem, penalty function method, Applied Mathematics, Dual problem, Penalty function method, global convergence, Computational Mathematics, Numerical mathematical programming methods, inner approximation method, reverse convex programming problem, Global optimization
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
