The following pages link to Bing-sheng He (Q539102):
Displayed 13 items.
- An improved contraction method for structured monotone variational inequalities (Q5505149) (← links)
- (Q5706576) (← 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)
- Navigating in a Graph by Aid of Its Spanning Tree Metric (Q5892569) (← links)
- A new accuracy criterion for approximate proximal point algorithms (Q5955039) (← links)
- A predict-correct projection method for monotone variant variational inequalities (Q5955917) (← links)
- Improvements of some projection methods for monotone nonlinear variational inequalities (Q5959903) (← links)
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities (Q5959904) (← links)
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent (Q5962713) (← links)
- Indefinite linearized augmented Lagrangian method for convex programming with linear inequality constraints (Q6366952) (← links)
- Extensions of ADMM for Separable Convex Optimization Problems with Linear Equality or Inequality Constraints (Q6371975) (← links)
- Balanced Augmented Lagrangian Method for Convex Programming (Q6375571) (← links)
- On construction of splitting contraction algorithms in a prediction-correction framework for separable convex optimization (Q6397381) (← links)