# Dong-Hui Li

According to our database

Collaborative distances:

^{1}, Dong-Hui Li authored at least 36 papers between 1999 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Linearized Methods for Tensor Complementarity Problems.

J. Optimization Theory and Applications, 2020

2019

An equivalent tensor equation to the tensor complementarity problem with positive semi-definite Z-tensor.

Optimization Letters, 2019

2017

Splitting methods for tensor equations.

Numerical Lin. Alg. with Applic., 2017

An Iterative Method for Finding the Least Solution to the Tensor Complementarity Problem.

J. Optimization Theory and Applications, 2017

Sparse Support Vector Machine with L p Penalty for Feature Selection.

J. Comput. Sci. Technol., 2017

Partitioned quasi-Newton methods for sparse nonlinear equations.

Comp. Opt. and Appl., 2017

2016

A Barzilai-Borwein-Like Iterative Half Thresholding Algorithm for the L

_{1/2}Regularized Problem.
J. Sci. Comput., 2016

2014

On the convergence properties of the unmodified PRP method with a non-descent line search.

Optimization Methods and Software, 2014

An Interior Point Method for L

_{1/2}-SVM and Application to Feature Selection in Classification.
J. Applied Mathematics, 2014

Research on a New Control Scheme of Photovoltaic Grid Power Generation System.

J. Applied Mathematics, 2014

A constrained optimization reformulation and a feasible descent direction method for L

_{1/2}regularization.
Comp. Opt. and Appl., 2014

2013

Low memory and low complexity iterative schemes for a nonsymmetric algebraic Riccati equation arising from transport theory.

J. Comput. Appl. Math., 2013

An extension of the Fletcher-Reeves method to linear equality constrained optimization problem.

Appl. Math. Comput., 2013

Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations.

Adv. Comput. Math., 2013

2012

An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method.

Optimization Methods and Software, 2012

2011

n-step quadratic convergence of the MPRP method with a restart strategy.

J. Comput. Appl. Math., 2011

Sufficient descent directions in unconstrained optimization.

Comp. Opt. and Appl., 2011

2010

A globally convergent derivative-free method for solving large-scale nonlinear monotone equations.

J. Comput. Appl. Math., 2010

2009

Truncated regularized Newton method for convex minimizations.

Comp. Opt. and Appl., 2009

2008

A new class of quasi-Newton updating formulas.

Optimization Methods and Software, 2008

A globally convergent BFGS method for nonlinear monotone equations without any merit functions.

Math. Comput., 2008

An active set limited memory BFGS algorithm for large-scale bound constrained optimization.

Math. Meth. of OR, 2008

Conjugate gradient method for the linear complementarity problem with S-matrix.

Mathematical and Computer Modelling, 2008

2007

A norm descent BFGS method for solving KKT systems of symmetric variational inequality problems.

Optimization Methods and Software, 2007

A practical update criterion for SQP method.

Optimization Methods and Software, 2007

A cautious BFGS update for reduced Hessian SQP.

Numerical Algorithms, 2007

2005

An iterative method for solving KKT system of the semi-infinite programming.

Optimization Methods and Software, 2005

2004

A Smoothing Newton Method for Semi-Infinite Programming.

J. Global Optimization, 2004

Regularized Newton Methods for Convex Minimization Problems with Singular Solutions.

Comp. Opt. and Appl., 2004

2003

A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization.

SIAM Journal on Optimization, 2003

Weighted max-norm estimate of additive schwarz methods for solving nonlinear complementarity problems.

Optimization Methods and Software, 2003

2002

Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations.

SIAM J. Numerical Analysis, 2002

2001

On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems.

SIAM Journal on Optimization, 2001

Globally Convergent Broyden-Like Methods for Semismooth Equations and Applications to VIP, NCP and MCP.

Annals OR, 2001

2000

Smoothing Newton and Quasi-Newton Methods for Mixed Complementarity Problems.

Comp. Opt. and Appl., 2000

1999

A Globally and Superlinearly Convergent Gauss-Newton-Based BFGS Method for Symmetric Nonlinear Equations.

SIAM J. Numerical Analysis, 1999