| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4617643 | Journal of Mathematical Analysis and Applications | 2012 | 5 Pages |
Abstract
In this paper, we show that the convex optimization problem can be solved by the proximal point algorithm in a finite number of steps under the assumption that the solution set is a set of weak sharp minima.
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
