Modified procedures of iterative prox-regularization
Two algorithms for solving convex programming problems are suggested. The algorithms are based on the introduction of the prox-regularization into the scheme of the penalty function method. In contrast to conventional approaches, the number of steps in the analyzed algorithms of the prox-method is not fixed in advance for every penalty function and is determined in the process of the algorithm operation. For well known linearization method and penalty function method the corresponding minimizing sequences have been proved to converge to a solution of optimization problem under an appropriate choice of control parameters and certain additional assumptions.
- Proximal methods in view of interior-point strategies
- On the iterative prox-regularization in the case of solving extremal problems
- scientific article; zbMATH DE number 4012323 (Why is no real title available?)
- The Projective SUMT Method for Convex Programming
- scientific article; zbMATH DE number 4121760 (Why is no real title available?)
- scientific article; zbMATH DE number 2112595 (Why is no real title available?)
- scientific article; zbMATH DE number 7083159 (Why is no real title available?)
This page was built for publication: Modified procedures of iterative prox-regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975095)