| Article ID: | iaor20127299 |
| Volume: | 6 |
| Issue: | 8 |
| Start Page Number: | 1773 |
| End Page Number: | 1785 |
| Publication Date: | Dec 2012 |
| Journal: | Optimization Letters |
| Authors: | Wang Changyu, Zhou Jinchuan |
| Keywords: | programming: convex |
In this paper, we study the concept of weak sharp minima by using conjugate functions. Not only some well‐known results can be obtained in this unified way, but also new characterizations are developed. Finally, under rather weak conditions, we establish the finite termination property for convex programming and variational inequality problem, respectively.