Donghui Li - Citegraph

Author Info

Name	Affiliation	Papers
DONGHUI LI	School of Mathematical Sciences, South China Normal University, Guangzhou, 510631, China	43
Collaborators	Citations	PageRank
56	380	32.40
Referers	Referees	References
498	384	389

Search Limit

100498

Publications (43 rows)

Collaborators (56 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Linearized Methods for Tensor Complementarity Problems	2	0.36	2020
A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization	0	0.34	2019
An equivalent tensor equation to the tensor complementarity problem with positive semi-definite <Emphasis Type="Italic">Z</Emphasis>-tensor	2	0.36	2019
An Iterative Method for Finding the Least Solution to the Tensor Complementarity Problem.	5	0.43	2017
Partitioned quasi-Newton methods for sparse nonlinear equations.	0	0.34	2017
Splitting methods for tensor equations.	5	0.43	2017
Sparse Support Vector Machine with L p Penalty for Feature Selection.	1	0.36	2017
A Barzilai-Borwein-Like Iterative Half Thresholding Algorithm for the L1/2 Regularized Problem.	0	0.34	2016
An unconstrained differentiable penalty method for implicit complementarity problems.	0	0.34	2016
On the convergence properties of the unmodified PRP method with a non-descent line search	0	0.34	2014
An Interior Point Method for L1/2-SVM and Application to Feature Selection in Classification.	0	0.34	2014
A constrained optimization reformulation and a feasible descent direction method for L1/2 regularization.	0	0.34	2014
An extension of the Fletcher-Reeves method to linear equality constrained optimization problem	1	0.36	2013
Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations	3	0.39	2013
Active allocation of systematic risk and control of risk sensitivity in portfolio optimization.	4	0.50	2013
The convergence rate of a restart MFR conjugate gradient method with inexact line search.	0	0.34	2012
An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method	1	0.37	2012
Sufficient descent directions in unconstrained optimization	5	0.61	2011
A projected semismooth Newton method for problems of calibrating least squares covariance matrix	1	0.36	2011
n-step quadratic convergence of the MPRP method with a restart strategy.	3	0.41	2011
A globally convergent derivative-free method for solving large-scale nonlinear monotone equations	8	0.60	2010
Newton's Method for Computing the Nearest Correlation Matrix with a Simple Upper Bound.	1	0.36	2010
Truncated regularized Newton method for convex minimizations	4	0.48	2009
An active set limited memory BFGS algorithm for large-scale bound constrained optimization	5	0.49	2008
A new class of quasi-Newton updating formulas	3	0.41	2008
A globally convergent BFGS method for nonlinear monotone equations without any merit functions	16	1.00	2008
Conjugate gradient method for the linear complementarity problem with S-matrix	4	0.66	2008
Some descent three-term conjugate gradient methods and their global convergence.	33	1.30	2007
A norm descent BFGS method for solving KKT systems of symmetric variational inequality problems.	1	0.35	2007
A practical update criterion for SQP method.	4	0.43	2007
Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems.	2	0.38	2007
A cautious BFGS update for reduced Hessian SQP	1	0.36	2007
Global convergence of a modified Fletcher–Reeves conjugate gradient method with Armijo-type line search	67	3.07	2006
An iterative method for solving KKT system of the semi-infinite programming	19	0.73	2005
A Smoothing Newton Method for Semi-Infinite Programming	22	1.02	2004
Regularized Newton Methods for Convex Minimization Problems with Singular Solutions	12	0.81	2004
A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization	14	0.89	2003
Weighted max-norm estimate of additive schwarz methods for solving nonlinear complementarity problems	0	0.34	2003
Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations	19	1.11	2002
Globally Convergent Broyden-Like Methods for Semismooth Equations and Applications to VIP, NCP and MCP	9	0.66	2001
On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems	50	3.63	2001
Smoothing Newton and quasi-Newton methods for mixed complementarity problems	11	0.90	2000
A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations	42	4.81	1999