Abstract | ||
---|---|---|
The aim of this paper is to recall the conventional gradient method and discuss its performance when the target function neither is strongly convex nor has a Lipschitz continuous gradient. By introducing the concepts of fractional order strong convexity and fractional order Lipschitz continuous gradient, some interesting properties of the gradient method are revealed. Furthermore, to keep the asymptotic convergence property of the gradient method when handling such convex functions, the fractional order gradient method is introduced. A careful simulation study is finally provided to demonstrate all the results. |
Year | Venue | Field |
---|---|---|
2018 | 2018 ANNUAL AMERICAN CONTROL CONFERENCE (ACC) | Convergence (routing),Gradient method,Applied mathematics,Convexity,Upper and lower bounds,Iterative method,Control theory,Computer science,Convex function,Lipschitz continuity |
DocType | ISSN | Citations |
Conference | 0743-1619 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yuquan Chen | 1 | 39 | 3.78 |
Yiheng Wei | 2 | 67 | 9.91 |
Yong Wang | 3 | 275 | 92.19 |
Yangquan Chen | 4 | 2257 | 242.16 |