Hongjin He

Orcid: 0000-0001-7672-4943

According to our database1, Hongjin He authored at least 38 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A low-rank and sparse enhanced Tucker decomposition approach for tensor completion.
Appl. Math. Comput., March, 2024

A Partially Inertial Customized Douglas-Rachford Splitting Method for a Class of Structured Optimization Problems.
J. Sci. Comput., January, 2024

2023
A partially inexact generalized primal-dual hybrid gradient method for saddle point problems with bilinear couplings.
J. Appl. Math. Comput., October, 2023

Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes.
J. Glob. Optim., April, 2023

2022
Tensor Completion via A Generalized Transformed Tensor T-Product Decomposition Without t-SVD.
J. Sci. Comput., 2022

A unified Douglas-Rachford algorithm for generalized DC programming.
J. Glob. Optim., 2022

An efficient alternating minimization method for fourth degree polynomial optimization.
J. Glob. Optim., 2022

2021
A customized low-rank prior model for structured cartoon-texture image decomposition.
Signal Process. Image Commun., 2021

A nonnegativity preserving algorithm for multilinear systems with nonsingular M-tensors.
Numer. Algorithms, 2021

An index detecting algorithm for a class of TCP(A, q) equipped with nonsingular M-tensors.
J. Comput. Appl. Math., 2021

A DCT-based Tensor Completion Approach for Recovering Color Images and Videos from Highly Undersampled Data.
CoRR, 2021

A partially proximal linearized alternating minimization method for finding Dantzig selectors.
Comput. Appl. Math., 2021

2020
Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor.
Numer. Algorithms, 2020

A Double Extrapolation Primal-Dual Algorithm for Saddle Point Problems.
J. Sci. Comput., 2020

Low-Rank and Sparse Enhanced Tucker Decomposition for Tensor Completion.
CoRR, 2020

Generalized Tensor Complementarity Problems Over a Polyhedral Cone.
Asia Pac. J. Oper. Res., 2020

2019
Generalized tensor equations with leading structured tensors.
Appl. Math. Comput., 2019

2018
A Globally and Quadratically Convergent Algorithm for Solving Multilinear Systems with ℳ-tensors.
J. Sci. Comput., 2018

Correction to: A partially isochronous splitting algorithm for three-block separable convex minimization problems.
Adv. Comput. Math., 2018

A partially isochronous splitting algorithm for three-block separable convex minimization problems.
Adv. Comput. Math., 2018

2017
A proximal partially parallel splitting method for separable convex programs.
Optim. Methods Softw., 2017

Improved approximation results on standard quartic polynomial optimization.
Optim. Lett., 2017

2016
An Implementable Splitting Algorithm for the ℓ<sub>1</sub>-norm Regularized Split Feasibility Problem.
J. Sci. Comput., 2016

A primal-dual prediction-correction algorithm for saddle point optimization.
J. Glob. Optim., 2016

Higher-degree eigenvalue complementarity problems for tensors.
Comput. Optim. Appl., 2016

On the cone eigenvalue complementarity problem for higher-order tensors.
Comput. Optim. Appl., 2016

A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA.
Comput. Optim. Appl., 2016

A distributed Douglas-Rachford splitting method for multi-block convex minimization problems.
Adv. Comput. Math., 2016

2015
A note on augmented Lagrangian-based parallel splitting method.
Optim. Lett., 2015

A Relaxed Projection Method for Split Variational Inequalities.
J. Optim. Theory Appl., 2015

A class of nonlinear proximal point algorithms for variational inequality problems.
Int. J. Comput. Math., 2015

A fast splitting method tailored for Dantzig selector.
Comput. Optim. Appl., 2015

2014
A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints.
Numerische Mathematik, 2014

A proximal parallel splitting method for minimizing sum of convex functions with linear constraints.
J. Comput. Appl. Math., 2014

A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations.
Appl. Math. Comput., 2014

2013
A hybrid splitting method for variational inequality problems with separable structure.
Optim. Methods Softw., 2013

A Progressive equilibration Algorithm for General Market equilibrium Problems under Constraints.
Asia Pac. J. Oper. Res., 2013

2012
Some projection methods with the BB step sizes for variational inequalities.
J. Comput. Appl. Math., 2012


  Loading...