Login / Signup

An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming.

Zhao DengSanyang Liu
Published in: Comput. Appl. Math. (2019)
Keyphrases
  • dynamic programming
  • objective function
  • similarity measure
  • computational complexity
  • support vector machine svm
  • convex programming