Stable iterative Lagrange principle in convex programming as a tool for solving unstable problems
- 作者: Kuterin F.A.1, Sumin M.I.1
-
隶属关系:
- Nizhny Novgorod State University
- 期: 卷 57, 编号 1 (2017)
- 页面: 71-82
- 栏目: Article
- URL: https://journals.rcsi.science/0965-5425/article/view/178864
- DOI: https://doi.org/10.1134/S0965542517010092
- ID: 178864
如何引用文章
详细
A convex programming problem in a Hilbert space with an operator equality constraint and a finite number of functional inequality constraints is considered. All constraints involve parameters. The close relation of the instability of this problem and, hence, the instability of the classical Lagrange principle for it to its regularity properties and the subdifferentiability of the value function in the problem is discussed. An iterative nondifferential Lagrange principle with a stopping rule is proved for the indicated problem. The principle is stable with respect to errors in the initial data and covers the normal, regular, and abnormal cases of the problem and the case where the classical Lagrange principle does not hold. The possibility of using the stable sequential Lagrange principle for directly solving unstable optimization problems is discussed. The capabilities of this principle are illustrated by numerically solving the classical ill-posed problem of finding the normal solution of a Fredholm integral equation of the first kind.
作者简介
F. Kuterin
Nizhny Novgorod State University
编辑信件的主要联系方式.
Email: kuterin.f@yandex.ru
俄罗斯联邦, Nizhny Novgorod, 603950
M. Sumin
Nizhny Novgorod State University
Email: kuterin.f@yandex.ru
俄罗斯联邦, Nizhny Novgorod, 603950
补充文件
