Zheng-Hai Huang
Orcid: 0000-0003-2269-961X
According to our database1,
Zheng-Hai Huang
authored at least 90 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Comput. Optim. Appl., September, 2024
J. Optim. Theory Appl., August, 2024
A linearized method for solving tensor complementarity problems with implicit Z-tensors.
Optim. Lett., June, 2024
Low-rank matrix recovery problem minimizing a new ratio of two norms approximating the rank function then using an ADMM-type solver with applications.
J. Comput. Appl. Math., March, 2024
J. Optim. Theory Appl., February, 2024
2023
Tensor Factorization-Based Method for Tensor Completion with Spatio-temporal Characterization.
J. Optim. Theory Appl., October, 2023
Existence of the least element solution of the vertical block Z-tensor complementarity problem.
Optim. Lett., September, 2023
Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities.
SIAM J. Matrix Anal. Appl., June, 2023
A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors.
J. Glob. Optim., June, 2023
Tensor Robust Principal Component Analysis via Tensor Fibered Rank and \({\boldsymbol{{l_p}}}\) Minimization.
SIAM J. Imaging Sci., March, 2023
Comput. Appl. Math., February, 2023
Asia Pac. J. Oper. Res., February, 2023
Low rank tensor recovery by schatten capped <i>p</i> norm and plug-and-play regularization.
Neurocomputing, 2023
2022
Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space.
J. Glob. Optim., 2022
A homotopy method for solving multilinear systems with strong completely positive tensors.
Appl. Math. Lett., 2022
2021
Nonemptiness and Compactness of Solution Sets to Weakly Homogeneous Generalized Variational Inequalities.
J. Optim. Theory Appl., 2021
J. Glob. Optim., 2021
T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming.
Comput. Optim. Appl., 2021
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
THOR, Trace-based Hardware-driven Layer-Oriented Natural Gradient Descent Computation.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
A Note on the Nonemptiness and Compactness of Solution Sets of Weakly Homogeneous Variational Inequalities.
SIAM J. Optim., 2020
Existence and uniqueness of solutions of the generalized polynomial variational inequality.
Optim. Lett., 2020
Nonemptiness and Compactness of Solution Sets to Generalized Polynomial Complementarity Problems.
J. Optim. Theory Appl., 2020
Stationary Probability Vectors of Higher-Order Two-Dimensional Symmetric Transition Probability Tensors.
Asia Pac. J. Oper. Res., 2020
2019
Math. Methods Oper. Res., 2019
J. Optim. Theory Appl., 2019
J. Optim. Theory Appl., 2019
An inexact augmented Lagrangian multiplier method for solving quadratic complementary problems: An adapted algorithmic framework combining specific resolution techniques.
J. Comput. Appl. Math., 2019
Iterative <i>p</i>-shrinkage thresholding algorithm for low Tucker rank tensor recovery.
Inf. Sci., 2019
Int. J. Pattern Recognit. Artif. Intell., 2019
A singular value <i>p</i>-shrinkage thresholding algorithm for low rank matrix recovery.
Comput. Optim. Appl., 2019
Stability of Solutions and Continuity of Solution Maps of Tensor Complementarity Problems.
Asia Pac. J. Oper. Res., 2019
2018
Multim. Tools Appl., 2018
J. Optim. Theory Appl., 2018
J. Optim. Theory Appl., 2018
Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms.
J. Comput. Appl. Math., 2018
J. Comput. Appl. Math., 2018
Comput. Optim. Appl., 2018
Appl. Math. Comput., 2018
2017
J. Optim. Theory Appl., 2017
A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation.
Inf. Sci., 2017
Int. J. Wavelets Multiresolution Inf. Process., 2017
Formulating an <i>n</i>-person noncooperative game as a tensor complementarity problem.
Comput. Optim. Appl., 2017
2016
A Customized Sparse Representation Model With Mixed Norm for Undersampled Face Recognition.
IEEE Trans. Inf. Forensics Secur., 2016
Comon's Conjecture, Rank Decomposition, and Symmetric Rank Decomposition of Symmetric Tensors.
SIAM J. Matrix Anal. Appl., 2016
Optim. Methods Softw., 2016
J. Optim. Theory Appl., 2016
Int. J. Wavelets Multiresolution Inf. Process., 2016
Comput. Optim. Appl., 2016
2015
Variational Feature Representation-based Classification for face recognition with single sample per person.
J. Vis. Commun. Image Represent., 2015
Face recognition based on pixel-level and feature-level fusion of the top-level's wavelet sub-bands.
Inf. Fusion, 2015
Asia Pac. J. Oper. Res., 2015
Appl. Math. Comput., 2015
2014
A Smoothing Newton Algorithm for a Class of Non-monotonic Symmetric Cone Linear Complementarity Problems.
J. Optim. Theory Appl., 2014
J. Comput. Appl. Math., 2014
2013
IEEE Trans. Signal Process., 2013
IEEE Trans. Inf. Theory, 2013
Optim. Lett., 2013
Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method.
Numer. Linear Algebra Appl., 2013
2012
J. Optim. Theory Appl., 2012
2011
Extension of smoothing Newton algorithms to solve linear programming over symmetric cones.
J. Syst. Sci. Complex., 2011
The column-sufficiency and row-sufficiency of the linear transformation on Hilbert spaces.
J. Glob. Optim., 2011
J. Comput. Appl. Math., 2011
A generalized Newton method for absolute value equations associated with second order cones.
J. Comput. Appl. Math., 2011
Comput. Optim. Appl., 2011
2010
Oper. Res. Lett., 2010
J. Sci. Comput., 2010
A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities.
J. Comput. Appl. Math., 2010
Comput. Optim. Appl., 2010
Finite termination of a Newton-type algorithm for a class of affine variational inequality problems.
Appl. Math. Comput., 2010
2009
A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems.
Optim. Methods Softw., 2009
A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones.
Math. Methods Oper. Res., 2009
2007
A revised cut-peak function method for box constrained continuous global optimization.
Appl. Math. Comput., 2007
2006
A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution.
Optim. Methods Softw., 2006
A Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming.
Comput. Optim. Appl., 2006
Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem.
Appl. Math. Comput., 2006
2005
Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms.
Math. Methods Oper. Res., 2005
On the Finite Termination of an Entropy Function Based Non-Interior Continuation Method for Vertical Linear Complementarity Problems.
J. Glob. Optim., 2005
Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs.
Appl. Math. Comput., 2005
2004
Sub-quadratic convergence of a smoothing Newton algorithm for the <i>P</i> <sub><i>0</i></sub>- and monotone LCP.
Math. Program., 2004
2003
Improved Approximation Algorithms for MAX \frac<i>n</i>\text2-DIRECTED-BISECTION and MAX \frac<i>n</i>\text2-DENSE-SUBGRAPH.
J. Glob. Optim., 2003