Triangulating between parallel splitting contours using a simplicial algorithm

1991 ◽  
Author(s):  
Rick Miranda ◽  
Thomas O. McCracken ◽  
Chris Fedde
Keyword(s):  
Simplicial Algorithm ◽  
Parallel Splitting

scholarly journals A Proximal Fully Parallel Splitting Method for Stable Principal Component Pursuit

2017 ◽  
Vol 2017 ◽  
pp. 1-15 ◽  
Author(s):  
Hongchun Sun ◽  
Jing Liu ◽  
Min Sun
Keyword(s):  
Signal Processing ◽  
Statistical Learning ◽  
Splitting Method ◽  
Principal Component ◽  
Computational Results ◽  
Closed Form Solutions ◽  
Mild Conditions ◽  
Separable Convex Programming ◽  
Parallel Splitting ◽  
Principal Component Pursuit

As a special three-block separable convex programming, the stable principal component pursuit (SPCP) arises in many different disciplines, such as statistical learning, signal processing, and web data ranking. In this paper, we propose a proximal fully parallel splitting method (PFPSM) for solving SPCP, in which the resulting subproblems all admit closed-form solutions and can be solved in distributed manners. Compared with other similar algorithms in the literature, PFPSM attaches a Glowinski relaxation factor η∈3/2,2/3 to the updating formula for its Lagrange multiplier, which can be used to accelerate the convergence of the generated sequence. Under mild conditions, the global convergence of PFPSM is proved. Preliminary computational results show that the proposed algorithm works very well in practice.

scholarly journals Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities

2011 ◽  
Vol 21 (4) ◽  
pp. 1251-1274 ◽  
Author(s):  
Hédy Attouch ◽  
Marc-Olivier Czarnecki ◽  
Juan Peypouquet
Keyword(s):  
Variational Inequalities ◽  
Parallel Splitting
Sign in / Sign up

Export Citation Format

Share Document