1 code implementation • 29 Sep 2019 • Yuning Yang, Guoyin Li
This problem is equivalent to finding the leading eigenvalue of the associated symmetric tensor of higher order, which is nonconvex and NP-hard.
Optimization and Control
no code implementations • 10 Feb 2019 • Peiran Yu, Guoyin Li, Ting Kei Pong
In addition, for nonconvex models, we show that the KL exponent of many difference-of-convex functions can be derived from that of their natural majorant functions, and the KL exponent of the Bregman envelope of a function is the same as that of the function itself.
no code implementations • 9 Feb 2016 • Guoyin Li, Ting Kei Pong
Since many existing local convergence rate analysis for first-order methods in the nonconvex scenario relies on the KL exponent, our results enable us to obtain explicit convergence rate for various first-order methods when they are applied to a large variety of practical optimization models.
no code implementations • 30 Sep 2014 • Guoyin Li, Ting Kei Pong
We then apply our nonconvex DR splitting method to finding a point in the intersection of a closed convex set $C$ and a general closed set $D$ by minimizing the squared distance to $C$ subject to $D$.
no code implementations • 3 Jul 2014 • Guoyin Li, Ting Kei Pong
In this paper, we examined two types of splitting methods for solving this nonconvex optimization problem: alternating direction method of multipliers and proximal gradient algorithm.
