Asset Details
Do you wish to reserve the book?
Best Pair Formulation & Accelerated Scheme for Non-convex Principal Component Pursuit
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Best Pair Formulation & Accelerated Scheme for Non-convex Principal Component Pursuit
Do you wish to request the book?
Best Pair Formulation & Accelerated Scheme for Non-convex Principal Component Pursuit
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
Best Pair Formulation & Accelerated Scheme for Non-convex Principal Component Pursuit
2019
Overview
The best pair problem aims to find a pair of points that minimize the distance between two disjoint sets. In this paper, we formulate the classical robust principal component analysis (RPCA) as the best pair; which was not considered before. We design an accelerated proximal gradient scheme to solve it, for which we show global convergence, as well as the local linear rate. Our extensive numerical experiments on both real and synthetic data suggest that the algorithm outperforms relevant baseline algorithms in the literature.
Publisher
Cornell University Library, arXiv.org
