On the Convergence of the Convex-Concave Procedure thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

On the Convergence of the Convex-Concave Procedure

Published on Jan 19, 20105237 Views

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

Related categories