Search
Abstract
We propose a new modified primal–dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates computed in previous steps in the formulas defining current iterate. To this end we consider projections onto intersections of halfspaces generated on the basis of the current as well as the previous iterates. To calculate these projections we are using recently obtained closed-form expressions for projectors onto polyhedral sets. The resulting algorithm with memory inherits strong convergence properties of the original best approximation proximal primal–dual algorithm. Additionally, we compare our algorithm with the original (non-inertial) one with the help of the so called attraction property defined below. Extensive numerical experimental results on image reconstruction problems illustrate the advantages of including memory into the original algorithm.
Citations
-
3
CrossRef
-
0
Web of Science
-
2
Scopus
Authors (3)
-
Ewa Bednarczuk Prof.
-
Krzysztof Edward Rutkowski
Cite as
Full text
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/s10589-018-0031-1
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
no. 71,
pages 767 - 794,
ISSN: 0926-6003 - Language:
- English
- Publication year:
- 2018
- Bibliographic description:
- Bednarczuk E., Węsierska A., Rutkowski K.: Proximal primal–dual best approximation algorithm with memory// COMPUTATIONAL OPTIMIZATION AND APPLICATIONS -Vol. 71,iss. 3 (2018), s.767-794
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/s10589-018-0031-1
- Verified by:
- Gdańsk University of Technology
seen 88 times