A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search. - Tie Ni; Ping Wang (Appl. Math. Comput., 2010)

Smoothing algorithms for complementarity problems over symmetric cones. - Zheng-Hai Huang; Tie Ni (Comput. Optim. Appl., 2010)

A note on quadratic convergence of a smoothing Newton algorithm for the LCP. - Tie Ni; Sheng-Long Hu (Optim. Lett., 2013)

A regularized smoothing Newton-type algorithm for quasi-variational inequalities. - Tie Ni; Jun Zhai (Comput. Math. Appl., 2014)

An inexact smoothing-type algorithm for support vector machines. - Tie Ni; Wei-Zhe Gu; Jun Zhai (Neurocomputing, 2014)

A matrix-free smoothing algorithm for large-scale support vector machines. - Tie Ni; Jun Zhai (Inf. Sci., 2016)

Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines. - Tie Ni (J. Appl. Math. Comput., 2020)

Discrete-time Euler-smoothing methods for time-varying convex constrained optimization. - Tie Ni; Xue-Zhi Xie; Wei-Zhe Gu (J. Frankl. Inst., 2024)