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

On a Global Search in D.C. Optimization Problems

Авторы: Strekalovsky A.S.

Журнал: Communications in Computer and Information Science: Proc. of the X Intern. Conf. on Optimization Methods and Applications «Optimization and applications» (OPTIMA-2019, Petrovac, Montenegro, September 30–October 4, 2019)

Том: 1145

Номер:

Год: 2020

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

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

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

URL:

Проекты:

DOI: 10.1007/978-3-030-38603-0_17

Аннотация: This paper addresses the nonconvex optimization problem with the cost function and equality and inequality constraints given by d.c. functions. The original problem is reduced to a problem without constraints by means of the exact penalization techniques. Furthermore, the penalized problem is presented as a d.c. minimization problem. For the latter problem, we apply the global optimality conditions (GOCs), which possess the so-called constructive (algorithmic) property. These new GOCs are generalized for the minimizing sequences, and a theoretical method is developed. Based on this theoretical foundation, a new global search scheme is designed for the auxiliary (penalized) and original problems, the convergence of which is one of the new results of the work.

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

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

Индексируется УБС: Нет

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

Индексируется ВАК: Нет

Индексируется CORE: Нет

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