W
Wen Huang
Researcher at Xiamen University
Publications - 55
Citations - 971
Wen Huang is an academic researcher from Xiamen University. The author has contributed to research in topics: Riemannian manifold & Optimization problem. The author has an hindex of 17, co-authored 54 publications receiving 717 citations. Previous affiliations of Wen Huang include Florida State University & University of Wisconsin-Madison.
Papers
More filters
Journal ArticleDOI
A Broyden Class of Quasi-Newton Methods for Riemannian Optimization
TL;DR: A generalization of the Broyden class of quasi-Newton methods to the problem of minimizing a smooth objective function on a Riemannian manifold is developed and a condition on vector transport and retraction that guarantees convergence and facilitates efficient computation is derived.
Journal ArticleDOI
A Riemannian symmetric rank-one trust-region method
TL;DR: The well-known symmetric rank-one trust-region method is generalized to the problem of minimizing a real-valued function over a Riemannian manifold and is shown to converge globally and $$d+1$$d-step q-superlinearly to stationary points of the objective function.
Optimization Algorithms on Riemannian Manifolds with Applications
TL;DR: In this paper, the authors generalized three well-known unconstrained optimization approaches for Rn to solve optimization problems with constraints that can be viewed as a d-dimensional Riemannian manifold.
Journal ArticleDOI
Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds
TL;DR: Using $\varepsilon$-subgradient-oriented descent directions and the Wolfe conditions, a nonsmooth Riemannian line search algorithm is proposed and the convergence of the algorithm to a stationary point is established.
Journal ArticleDOI
Riemannian proximal gradient methods
Wen Huang,Ke Wei +1 more
TL;DR: In this article, a Riemannian proximal gradient method (RPG) and its accelerated variant (ARPG) were developed for similar problems but constrained on a manifold, and the global convergence of RPG was established under mild assumptions, while the O(1/k) was also derived for ARPG based on the notion of retraction convexity.