Abstract

Recently, a strictly contractive Peaceman–Rachford splitting method with logarithmic-quadratic proximal regularization (SPRSM-LQP) was proposed for solving two-block separable convex minimization model. In practical applications, however, the smaller step-size should be strongly avoided. So we actually have the desire of seeking larger step-size whenever possible in order to accelerate the numerical performance. In this paper, we combine Fortin and Glowinski's accelerating techniques with the SPRSM-LQP. Thus a new algorithm with larger step-size is proposed. Under the same assumptions as the SPRSM-LQP, we establish the global convergence of its larger step-size counterpart. Moreover, preliminary numerical results show that the proposed method on a traffic network equilibrium problem is reliable and more efficient with larger step-size.

Full Text
Paper version not known

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 call

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.