In this paper, we present a decomposition method to solve minimization problem of convex function with box constraints. In the method, the feasible regionis decomposed into a series of simplice and iterating the optim...In this paper, we present a decomposition method to solve minimization problem of convex function with box constraints. In the method, the feasible regionis decomposed into a series of simplice and iterating the optimal solutions in thesimplex to the optimal solution of the original problem. In addition, we also carryout some numerical experiments and obtain fairly good numerical results.展开更多
文摘In this paper, we present a decomposition method to solve minimization problem of convex function with box constraints. In the method, the feasible regionis decomposed into a series of simplice and iterating the optimal solutions in thesimplex to the optimal solution of the original problem. In addition, we also carryout some numerical experiments and obtain fairly good numerical results.
