On convergence rate estimates for power penalty methods

A very simple and efficient approach to deriving estimates of the convergence rate for the penalty methods is suggested. The approach is based on the application of results of the sensitivity theory to optimization problems. The suggested convergence analysis uses either various sufficient optimality conditions without imposing any regularity requirements on the constraints or growth conditions under weakened regularity requirements on the constraints. Copyright © 2004 by MAIK "Nauka/Interperiodica".

Авторы
Avakov E.R.1 , Arutyunov A.V. 2 , Izmailov A.F.3
Номер выпуска
10
Язык
Английский
Страницы
1684-1695
Статус
Опубликовано
Том
44
Год
2004
Организации
  • 1 Institute of Control Sciences (Automation and Telemechanics), Russian Academy of Sciences, Profsoyuznaya ul. 65, Moscow, 117806, Russian Federation
  • 2 Peoples Friendship University, ul. Miklukho-Maklaya 6, Moscow, 117198, Russian Federation
  • 3 Department of Computational Mathematics and Cybernetics, Moscow State University, Vorob'evy gory, Moscow, 119992, Russian Federation
Ключевые слова
Convergence rate estimates; Mathematical programming problems; Optimization methods; Power penalty method
Дата создания
19.10.2018
Дата изменения
19.10.2018
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/3592/
Поделиться

Другие записи