Pages that link to "Item:Q382899"

The following pages link to A parallel splitting method for separable convex programs (Q382899):

Displaying 23 items.

• An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
• Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints (Q291885) (← links)
• A new parallel splitting descent method for structured variational inequalities (Q380579) (← links)
• A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems (Q614333) (← links)
• Lagrangian penalization scheme with parallel forward-backward splitting (Q725876) (← links)
• Parallel alternating direction multiplier decomposition of convex programs (Q1321443) (← links)
• A partially parallel prediction-correction splitting method for convex optimization problems with separable structure (Q1689069) (← links)
• Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training (Q1790674) (← links)
• A parallel splitting ALM-based algorithm for separable convex programming (Q2057225) (← links)
• An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems (Q2105290) (← links)
• A survey on some recent developments of alternating direction method of multipliers (Q2136506) (← links)
• A proximal parallel splitting method for minimizing sum of convex functions with linear constraints (Q2348955) (← links)
• Parallel extragradient algorithms for multiple set split equilibrium problems in Hilbert spaces (Q2413277) (← links)
• A new partial splitting augmented Lagrangian method for minimizing the sum of three convex functions (Q2434850) (← links)
• A Parallel Algorithm for a Class of Convex Programs (Q3787794) (← links)
• A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1 (Q4345058) (← links)
• (Q4514797) (← links)
• Study on the Splitting Methods for Separable Convex Optimization in a Unified Algorithmic Framework (Q4998188) (← links)
• A splitting method for separable convex programming (Q5174194) (← links)
• (Q5260299) (← links)
• A proximal partially parallel splitting method for separable convex programs (Q5268890) (← links)
• A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming (Q5886869) (← links)
• A splitting algorithm for constrained optimization problems with parabolic equations (Q6102418) (← links)