Abstract
SummaryIn the fields of wireless communication and data processing, there are varieties of mathematical optimization problems, especially nonconvex and nonsmooth problems. For these problems, one of the biggest difficulties is how to improve the speed of solution. To this end, here we mainly focused on a minimization optimization model that is nonconvex and nonsmooth. Firstly, an inertial Douglas–Rachford splitting (IDRS) algorithm was established, which incorporate the inertial technology into the framework of the Douglas–Rachford splitting algorithm. Then, we illustrated the iteration sequence generated by the proposed IDRS algorithm converges to a stationary point of the nonconvex nonsmooth optimization problem with the aid of the Kurdyka–Łojasiewicz property. Finally, a series of numerical experiments were carried out to prove the effectiveness of our proposed algorithm from the perspective of signal recovery. The results are implicit that the proposed IDRS algorithm outperforms another algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Concurrency and Computation: Practice and Experience
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
