Dong-Hui Li

According to our database1, Dong-Hui Li authored at least 41 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A power-like method for finding the spectral radius of a weakly irreducible nonnegative symmetric tensor.
Comput. Optim. Appl., December, 2024

Internet traffic tensor completion with tensor nuclear norm.
Comput. Optim. Appl., April, 2024

2023
Feasible Newton methods for symmetric tensor <i>Z</i>-eigenvalue problems.
Optim. Methods Softw., May, 2023

Finding the spectral radius of a nonnegative irreducible symmetric tensor via DC programming.
CoRR, 2023

2021
Newton's Method for M-Tensor Equations.
J. Optim. Theory Appl., 2021

2020
Linearized Methods for Tensor Complementarity Problems.
J. Optim. Theory Appl., 2020

2019
An equivalent tensor equation to the tensor complementarity problem with positive semi-definite Z-tensor.
Optim. Lett., 2019

2017
Splitting methods for tensor equations.
Numer. Linear Algebra Appl., 2017

An Iterative Method for Finding the Least Solution to the Tensor Complementarity Problem.
J. Optim. Theory Appl., 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.
Comput. Optim. Appl., 2017

2016
A Barzilai-Borwein-Like Iterative Half Thresholding Algorithm for the L<sub>1/2</sub> Regularized Problem.
J. Sci. Comput., 2016

2014
On the convergence properties of the unmodified PRP method with a non-descent line search.
Optim. Methods Softw., 2014

An Interior Point Method for L<sub>1/2</sub>-SVM and Application to Feature Selection in Classification.
J. Appl. Math., 2014

Research on a New Control Scheme of Photovoltaic Grid Power Generation System.
J. Appl. Math., 2014

A constrained optimization reformulation and a feasible descent direction method for L<sub>1/2</sub> regularization.
Comput. Optim. 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.
Optim. Methods Softw., 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.
Comput. Optim. 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.
Comput. Optim. Appl., 2009

2008
A new class of quasi-Newton updating formulas.
Optim. Methods Softw., 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. Methods Oper. Res., 2008

Conjugate gradient method for the linear complementarity problem with S-matrix.
Math. Comput. Model., 2008

2007
A norm descent BFGS method for solving KKT systems of symmetric variational inequality problems.
Optim. Methods Softw., 2007

A practical update criterion for SQP method.
Optim. Methods Softw., 2007

A cautious BFGS update for reduced Hessian SQP.
Numer. Algorithms, 2007

2005
An iterative method for solving KKT system of the semi-infinite programming.
Optim. Methods Softw., 2005

2004
A Smoothing Newton Method for Semi-Infinite Programming.
J. Glob. Optim., 2004

Regularized Newton Methods for Convex Minimization Problems with Singular Solutions.
Comput. Optim. Appl., 2004

2003
A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization.
SIAM J. Optim., 2003

Weighted max-norm estimate of additive schwarz methods for solving nonlinear complementarity problems.
Optim. Methods Softw., 2003

2002
Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations.
SIAM J. Numer. Anal., 2002

2001
On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems.
SIAM J. Optim., 2001

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

2000
Smoothing Newton and Quasi-Newton Methods for Mixed Complementarity Problems.
Comput. Optim. Appl., 2000

1999
A Globally and Superlinearly Convergent Gauss-Newton-Based BFGS Method for Symmetric Nonlinear Equations.
SIAM J. Numer. Anal., 1999


  Loading...