On the Convergence of the Convex-Concave Procedure

author: Bharath K. Sriperumbudur, Department of Electrical and Computer Engineering, UC San Diego
published: Jan. 19, 2010,   recorded: December 2009,   views: 5211


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


The concave-convex procedure (CCCP) is a majorization-minimization 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 like sparse support vector machines (SVMs), transductive SVMs, sparse principal component analysis, etc. Though widely used in many applications, the convergence behavior of CCCP has not gotten a lot of specific attention. In this paper, we provide a rigorous analysis of the convergence of CCCP by addressing these questions:

  • (i) When does CCCP find a local minimum or a stationary point of the d.c. program under consideration?
  • (ii) When does the sequence generated by CCCP converge?

We also present an open problem on the issue of local convergence of CCCP.

See Also:

Download slides icon Download slides: nipsworkshops09_sriperumbudur_ccc_01.pdf (209.7┬áKB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 Kim Wells, April 15, 2016 at 11:03 a.m.:


Write your own review or comment:

make sure you have javascript enabled or clear this field: