Поиск по сайту


   


Результаты поиска ( Сортировать по релевантности | Отсортировано по дате )


Simplex embedding method in decomposition of large sparse convex nondifferentiable optimization problems

... nondifferentiable concave function with subgradient that can be easily calculated at each feasible point. Simplex embedding method with modifications gives us the appropriate performance to optimize nondifferentiable function that will be demonstrated on the numerical tests. Copyright © by the paper's authors. нет

Теги: decomposition , lagrangean relaxation , nondifferentiable optimization , simplex embedding method , optimization , concave function , convex problems , embedding method , non-differentiable , non-differentiable functions , non-differentiable optimization , numerical
Раздел: ИСЭМ СО РАН


x
x