An approach to the solution of nonlinear unconstrained optimization problems
Cybernetics and Systems Analysis
Hi-index | 0.00 |
A decomposition scheme for block nonlinear convex programming problems with coupling variables is considered. The possibility is examined of using approximated solutions of subproblems for generating subgradients of the functions that appear in the master problem. A regularization of the original problem that simplifies the master problem is considered.