Constraint Reduction Reformulations for Projection Algorithms with Applications to Wavelet Construction

Minh N. Dao (), Neil D. Dizon (), Jeffrey A. Hogan () and Matthew K. Tam ()
Additional contact information
Minh N. Dao: Federation University Australia
Neil D. Dizon: University of Newcastle
Jeffrey A. Hogan: University of Newcastle
Matthew K. Tam: The University of Melbourne

Journal of Optimization Theory and Applications, 2021, vol. 190, issue 1, No 9, 233 pages

Abstract: Abstract We introduce a reformulation technique that converts a many-set feasibility problem into an equivalent two-set problem. This technique involves reformulating the original feasibility problem by replacing a pair of its constraint sets with their intersection, before applying Pierra’s classical product space reformulation. The step of combining the two constraint sets reduces the dimension of the product spaces. We refer to this technique as the constraint reduction reformulation and use it to obtain constraint-reduced variants of well-known projection algorithms such as the Douglas–Rachford algorithm and the method of alternating projections, among others. We prove global convergence of constraint-reduced algorithms in the presence of convexity and local convergence in a nonconvex setting. In order to analyze convergence of the constraint-reduced Douglas–Rachford method, we generalize a classical result which guarantees that the composition of two projectors onto subspaces is a projector onto their intersection. Finally, we apply the constraint-reduced versions of Douglas–Rachford and alternating projections to solve the wavelet feasibility problems and then compare their performance with their usual product variants.

Keywords: Alternating projections; Cyclic projections; Douglas–Rachford; Fixed point iterations; Wavelets; 90C26; 47H10; 65K10; 65T60 (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-021-01878-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:190:y:2021:i:1:d:10.1007_s10957-021-01878-z

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-021-01878-z

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().