Страница публикации

D.C. Programming Approach to Malfatti's Problem

Авторы: Enkhbat R., Barkova M.V., Sukhee B.

Журнал: Вестник Бурятского гос. ун-та. Математика, информатика

Том:

Номер: 4

Год: 2018

Отчётный год: 2018

Издательство:

Местоположение издательства:

URL:

Аннотация: In previous works R. Enkhbat showed that the Malfatti's problem can be treated as the convex maximization problem and provided with an algorithm based on Global Optimality Conditions of A. S. Strekalovsky. In this article we reformulate Malfatti’s problem as a D.C. programming problem with a nonconvex constraint. The reduced problem as an optimization problem with D.C. constraints belongs to a class of global optimization. We apply the local and global optimality conditions by A. S. Strekalovsky developed for D.C programming. Based on local search methods for D.C. programming, we have developed an algorithm for numerical solution of Malfatti's problem. In numerical experiments, initial points of the proposed algorithm are chosen randomly. Global solutions have been found in all cases.

Индексируется WOS: 0

Индексируется Scopus: 0

Индексируется РИНЦ: 1

Публикация в печати: 0

Добавил в систему: