A proof of convergence of the concave-convex procedure using Zangwill's theory

The concave-convex procedure (CCCP) is an iterative algorithm that solves d.c. (difference of convex functions) programs as a sequence of convex programs. In machine learning, CCCP is extensively used in many learning algorithms, including sparse support vector machines (SVMs), transductive SVMs, an...

Full description

Bibliographic Details

Published in:	Neural computation Vol. 24; no. 6; p. 1391
Main Authors:	Sriperumbudur, Bharath K, Lanckriet, Gert R G
Format:	Journal Article
Language:	English
Published:	United States 01.06.2012
ISSN:	1530-888X, 1530-888X
Online Access:	Get more information
Tags:	Add Tag No Tags, Be the first to tag this record!