3 citations · 4 across the 4 of their papers we have counts for
12 papers · 1 filter
An Improved Spectral Conjugate Gradient Algorithm Based on A Modified Wolfe Line Search
Hao Wu, Liping Wang, Hongchao Zhang
In this paper, we combine the th-order Taylor expansion of the objective function with cubic Hermite interpolation conditions. Then, we derive a series of modified secant equati…
A Gradient-Based Implementation of the Polyhedral Active Set Algorithm
William W. Hager, Hongchao Zhang
The Polyhedral Active Set Algorithm (PASA) is designed to optimize a general nonlinear function over a polyhedron. Phase one of the algorithm is a nonmonotone gradient projection a…
Golden ratio primal-dual algorithm with linesearch
Xiaokai Chang, Junfeng Yang, Hongchao Zhang
Golden ratio primal-dual algorithm (GRPDA) is a new variant of the classical Arrow-Hurwicz method for solving structured convex optimization problem, in which the objective functio…
Convergence on a symmetric accelerated stochastic ADMM with larger stepsizes
Jianchao Bai, Deren Han, Hao Sun +1
In this paper, we develop a symmetric accelerated stochastic Alternating Direction Method of Multipliers (SAS-ADMM) for solving separable convex optimization problems with linear c…
An Inexact Accelerated Stochastic ADMM for Separable Convex Optimization
Jianchao Bai, William W. Hager, Hongchao Zhang
An inexact accelerated stochastic Alternating Direction Method of Multipliers (AS-ADMM) scheme is developed for solving structured separable convex optimization problems with linea…
On the acceleration of the Barzilai-Borwein method
Yakui Huang, Yu-Hong Dai, Xin-Wei Liu +1
The Barzilai-Borwein (BB) gradient method is efficient for solving large-scale unconstrained problems to the modest accuracy and has a great advantage of being easily extended to s…