NSF PAR Search | NSF Public Access Repository

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.

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
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
On the Asymptotic Convergence and Acceleration of Gradient Methods

https://doi.org/10.1007/s10915-021-01685-8

Huang, Yakui; Dai, Yu-Hong; Liu, Xin-Wei; Zhang, Hongchao (January 2022, Journal of Scientific Computing)

Full Text Available
A convexity enforcing $${C}^{{0}}$$ interior penalty method for the Monge–Ampère equation on convex polygonal domains

https://doi.org/10.1007/s00211-021-01210-x

Brenner, Susanne C.; Sung, Li-yeng; Tan, Zhiyu; Zhang, Hongchao (June 2021, Numerische Mathematik)
null (Ed.)
Abstract We design and analyze a $$C^0$$ C 0 interior penalty method for the approximation of classical solutions of the Dirichlet boundary value problem of the Monge–Ampère equation on convex polygonal domains. The method is based on an enhanced cubic Lagrange finite element that enables the enforcement of the convexity of the approximate solutions. Numerical results that corroborate the a priori and a posteriori error estimates are presented. It is also observed from numerical experiments that this method can capture certain weak solutions.
more » « less
Full Text Available
A Nonmonotone Smoothing Newton Algorithm for Weighted Complementarity Problem

https://doi.org/10.1007/s10957-021-01839-6

Tang, Jingyong; Zhang, Hongchao (June 2021, Journal of Optimization Theory and Applications)
null (Ed.)
Full Text Available
A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems

https://doi.org/10.1007/s11075-021-01069-x

Jiang, Fan; Wu, Zhongming; Cai, Xingju; Zhang, Hongchao (March 2021, Numerical Algorithms)
null (Ed.)
Full Text Available
Convergence rates for an inexact ADMM applied to separable convex optimization

https://doi.org/10.1007/s10589-020-00221-y

Hager, William W.; Zhang, Hongchao (December 2020, Computational Optimization and Applications)
null (Ed.)
Full Text Available
Inexact proximal stochastic second-order methods for nonconvex composite optimization

https://doi.org/10.1080/10556788.2020.1713128

Wang, Xiao; Zhang, Hongchao (July 2020, Optimization Methods and Software)

Full Text Available

« Prev Next »

Search for: All records