en
0.25
0.5
0.75
1.25
1.5
1.75
2
On Convergence Rate of Concave-Convex Procedure
Published on Feb 4, 20253984 Views
Concave-Convex Procedure (CCCP) has been widely used to solve nonconvex d.c.(difference of convex function) programs occur in learning problems, such as sparse support vector machine (SVM), transducti
Related categories
Presentation
On Convergence Rate of Concave-Convex Procedure00:00
Outline00:15
D.C. Program (1)01:04
D.C. Program (2)01:26
D.C. Program (3)02:07
D.C. Program (4)03:18
Concave-Convex Procedure03:46
CCCP as Majorization Minimization (MM) (1)05:04
CCCP as Majorization Minimization (MM) (2)06:02
CCCP as Majorization Minimization (MM) (3)06:46
MM as Block Coordinate Descent (1)07:26
MM as Block Coordinate Descent (2)08:24
Block Coordinate Descent for Non-convex, Non-smooth Problem09:43
Convergence Theorem of CCCP15:11
Reference15:18