Abstract
This paper presents two proximal-based pre-correction decomposition methods for convex minimization problems with separable structures. The methods, derived from Chen and Teboulle’s proximal-based decomposition method and He’s parallel splitting augmented Lagrangian method, remain the nice convergence property of the proximal point method and could compute variables in parallel like He’s method under the prediction-correction framework. Convergence results are established without additional assumptions. And the efficiency of the proposed methods is illustrated by some preliminary numerical experiments.
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: Journal of the Operations Research Society of China
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.
