Research Article
An Accelerated Proximal Algorithm for the Difference of Convex Programming
| Initial step. Take , , and . | | Iterative step. Compute the new iterate by the following iterative scheme: | | | until is satisfied | where is the Lipschitz constant of . |
|