Pages that link to "Item:Q1743377"

The following pages link to Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit (Q1743377):

Displaying 7 items.

• Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming (Q824816) (← links)
• A proximal fully parallel splitting method for stable principal component pursuit (Q1993345) (← links)
• Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA (Q2363673) (← links)
• An accelerated proximal augmented Lagrangian method and its application in compressive sensing (Q2412861) (← links)
• A proximal splitting method for separable convex programming and its application to compressive sensing (Q3455368) (← links)
• Maximum bisections of graphs with girth at least six (Q6640955) (← links)
• A subspace derivative-free projection method for convex constrained nonlinear equations (Q6671890) (← links)