On the Choice of Parameters in the Residual Method for the Optimal Correction of Improper Problems of Convex Optimization
For the correction of improper problems of convex programming, the residual method is used, which is the standard regularization procedure for ill-defined optimization models. We propose new iterative implementations of the residual method, in which the constraints of the problem are included by means of penalty functions. New convergence conditions are established for algorithmic schemes, and estimates are found for the approximation error.
Keywordsconvex programming improper problem optimal correction residual method penalty function methods.
Unable to display preview. Download preview PDF.
- 1.V. D. Skarin, “On an algorithm for optimal correction of inconsistent problems of convex programming,” in Optimization and Applications: Proceedings of the 6th International Conference, Petrovac, Montenegro, 2015, pp. 166–167.Google Scholar
- 2.F. P. Vasil’ev, Optimization Methods (MTsNMO, Moscow, 2011), Vols. 1, 2 [in Russian].Google Scholar
- 14.A. B. Bakushinskii and A. V. Goncharskii, Iterative Methods for Solving Ill-Posed Problems (Nauka, Moscow, 1989) [in Russian].Google Scholar
- 17.L. D. Popov, “On the adaptation of the least squares method to improper problems of mathematical programming,” Trudy Inst. Mat. Mekh. UrO RAN 19 (2), 247–255 (2013).Google Scholar