Skip to main navigation
Skip to search
Skip to main content
Hong Kong Baptist University Home
Help & FAQ
Home
Scholars
Departments / Units
Research Output
Projects / Grants
Prizes / Awards
Activities
Press/Media
Student theses
Datasets
Search by expertise, name or affiliation
A splitting method for separable convex programming
Bingsheng He
, Min Tao
, Xiaoming Yuan
*
*
Corresponding author for this work
Department of Mathematics
Research output
:
Contribution to journal
›
Journal article
›
peer-review
79
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A splitting method for separable convex programming'. Together they form a unique fingerprint.
Sort by:
Weight
Alphabetically
Mathematics
Convergence Rate
100%
Convex Minimization Problem
100%
Convex Programming
100%
Linear Constraint
100%
Objective Function
100%
Operator Splitting
100%
Worst Case
100%
Keyphrases
Convex Minimization Problem
50%
Coupling Variable
50%
Global Convergence
50%
Individual Functions
50%
Linear Constraints
50%
Numerical Efficiency
50%
Operator Splitting Method
50%
Separable Convex Optimization
50%
Separable Convex Programming
100%
Splitting Method
100%
Worst-case Convergence Rate
50%