Search for: All records | NSF Public Access

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

Client Selection for Wireless Federated Learning With Data and Latency Heterogeneity

https://doi.org/10.1109/JIOT.2024.3425757

Chen, Xiaobing ; Zhou, Xiangwei ; Zhang, Hongchao ; Sun, Mingxuan ; Poor, H Vincent ( July 2024 , IEEE Internet of Things Journal)

Free, publicly-accessible full text available July 9, 2025
Convergence Analysis of an Adaptively Regularized Natural Gradient Method

https://doi.org/10.1109/TSP.2024.3398496

Wu, Jiayuan ; Hu, Jiang ; Zhang, Hongchao ; Wen, Zaiwen ( May 2024 , IEEE Transactions on Signal Processing)

Free, publicly-accessible full text available May 9, 2025
A unified proximal gradient method for nonconvex composite optimization with extrapolation

https://doi.org/10.3934/naco.2024005

Zhang, Miao ; Zhang, Hongchao ( January 2024 , Numerical Algebra, Control and Optimization)

Free, publicly-accessible full text available January 1, 2025
Algorithm 1035: A Gradient-based Implementation of the Polyhedral Active Set Algorithm

https://doi.org/10.1145/3583559

Hager, William W. ; Zhang, Hongchao ( June 2023 , ACM Transactions on Mathematical Software)

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 algorithm, while phase two is an active set algorithm that explores faces of the constraint polyhedron. A gradient-based implementation is presented, where a projected version of the conjugate gradient algorithm is employed in phase two. Asymptotically, only phase two is performed. Comparisons are given with IPOPT using polyhedral-constrained problems from CUTEst and the Maros/Meszaros quadratic programming test set.

more » « less
Full Text Available
An Accelerated Smoothing Newton Method with Cubic Convergence for Weighted Complementarity Problems

https://doi.org/10.1007/s10957-022-02152-6

Tang, Jingyong ; Zhou, Jinchuan ; Zhang, Hongchao ( February 2023 , Journal of Optimization Theory and Applications)

Full Text Available
Golden Ratio Primal-Dual Algorithm with Linesearch

https://doi.org/10.1137/21M1420319

Chang, Xiao-Kai ; Yang, Junfeng ; Zhang, Hongchao ( September 2022 , SIAM Journal on Optimization)

Full Text Available
Unified linear convergence of first-order primal-dual algorithms for saddle point problems

https://doi.org/10.1007/s11590-021-01832-y

Jiang, Fan ; Wu, Zhongming ; Cai, Xingju ; Zhang, Hongchao ( July 2022 , Optimization Letters)

Full Text Available
On the acceleration of the Barzilai–Borwein method

https://doi.org/10.1007/s10589-022-00349-z

Huang, Yakui ; Dai, Yu-Hong ; Liu, Xin-Wei ; Zhang, Hongchao ( April 2022 , Computational Optimization and Applications)

Full Text Available
Convergence on a Symmetric Accelerated Stochastic ADMM with Larger Stepsizes

https://doi.org/10.4208/csiam-am.SO-2021-0021

null, null ( March 2022 , CSIAM Transactions on Applied Mathematics)

Full Text Available
An inexact accelerated stochastic ADMM for separable convex optimization

https://doi.org/10.1007/s10589-021-00338-8

Bai, Jianchao ; Hager, William W. ; Zhang, Hongchao ( March 2022 , Computational Optimization and Applications)

Full Text Available

« Prev Next »