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".

Authors
Avakov E.R.1 , Arutyunov A.V. 2 , Izmailov A.F.3
Number of issue
10
Language
English
Pages
1684-1695
Status
Published
Volume
44
Year
2004
Organizations
  • 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
Keywords
Convergence rate estimates; Mathematical programming problems; Optimization methods; Power penalty method
Date of creation
19.10.2018
Date of change
19.10.2018
Short link
https://repository.rudn.ru/en/records/article/record/3592/
Share

Other records