Journal of Pure and Applied Mathematics: Advances and ApplicationsAuthor's: STEFAN M. STEFANOV
Pages: [107] - [135]
Received Date: February 14, 2013
Submitted by:
In this paper, we consider the problem of minimizing a convex separable exponential function over a feasible region defined by a linear equality constraint and box constraints (bounds on the variables). Problems of this form are interesting from both theoretical and practical point of view because they arise in some mathematical optimization problems as well as in various practical applications. Algorithms of polynomial computational complexity are proposed for solving problems of this form and their convergence is proved. Some examples and results of numerical experiments are also presented.
exponential function, convex programming, separable programming, polynomial algorithms, computational complexity.
