Hui Zhang

Orcid: 0000-0002-8728-7168

Affiliations:
  • National University of Defense Technology, Department of Mathematics, Changsha, China


According to our database1, Hui Zhang authored at least 25 papers between 2010 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems.
Oper. Res. Lett., 2022

Inertial proximal incremental aggregated gradient method with linear convergence guarantees.
Math. Methods Oper. Res., 2022

Bregman iterative regularization using model functions for nonconvex nonsmooth optimization.
Frontiers Appl. Math. Stat., 2022

2021
Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions.
Math. Oper. Res., 2021

2020
Training GANs with centripetal acceleration.
Optim. Methods Softw., 2020

New analysis of linear convergence of gradient-type methods via unifying error bound conditions.
Math. Program., 2020

Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions.
J. Glob. Optim., 2020

2019
Nonconvex Proximal Incremental Aggregated Gradient Method with Linear Convergence.
J. Optim. Theory Appl., 2019

Training GANs with Centripetal Acceleration.
CoRR, 2019

2017
Projected shrinkage algorithm for box-constrained ℓ<sub>1</sub>-minimization.
Optim. Lett., 2017

The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth.
Optim. Lett., 2017

2016
One condition for solution uniqueness and robustness of both l1-synthesis and l1-analysis minimizations.
Adv. Comput. Math., 2016

2015
Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization.
Optim. Lett., 2015

Necessary and Sufficient Conditions of Solution Uniqueness in 1-Norm Minimization.
J. Optim. Theory Appl., 2015

2014
Proximal linearized iteratively reweighted least squares for a class of nonconvex and nonsmooth problems.
CoRR, 2014

2013
One condition for all: solution uniqueness and robustness of ℓ<sub>1</sub>-synthesis and ℓ<sub>1</sub>-analysis minimizations
CoRR, 2013

Gradient methods for convex minimization: better rates under weaker conditions
CoRR, 2013

A dual algorithm for a class of augmented convex models.
CoRR, 2013

New bounds for circulant Johnson-Lindenstrauss embeddings.
CoRR, 2013

2012
On the Constrained Minimal Singular Values for Sparse Signal Recovery.
IEEE Signal Process. Lett., 2012

A Fast Fixed Point Algorithm for Total Variation Deblurring and Segmentation.
J. Math. Imaging Vis., 2012

Necessary and sufficient conditions of solution uniqueness in ℓ<sub>1</sub> minimization
CoRR, 2012

Reweighted minimization model for MR image reconstruction with split Bregman method.
Sci. China Inf. Sci., 2012

2011
Strongly Convex Programming for Exact Matrix Completion and Robust Principal Component Analysis
CoRR, 2011

2010
Projected Landweber iteration for matrix completion.
J. Comput. Appl. Math., 2010


  Loading...