Jein-Shan Chen

dblp:24/5450 · DBLP profile ↗
← Back
17ranked-venue papers
4as first author
4since 2021 · last 2026
0000-0002-4596-9419ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 9 · 3 first-author · 2 since 2021Artificial intelligence and machine learning · 6 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author
YearPublicationVenuePosition
2026 A third-order-convergence improved Newton method and its numerical performance
abstract
This study focuses on an improved Newton-type iterative scheme for solving systems of nonlinear equations, which is based on a rational approximation with linear numerator and denominator (RALND) model and proposed in (Saheya et al SpringerPlus 5:1–13, 2016). We prove and verify the third-order convergence of this algorithm through theoretical analysis and numerical computations. Numerical experiments and application instances are conducted to demonstrate its effectiveness. The performance profile compares this method with traditional Newton’s method and another third-order convergent method, which shows that this method outperforms the traditional Newton’s method in terms of the number of iterations, and its computational efficiency is comparable to that of the third-order method. The analysis of the basin of attraction maps compares the INM method with the traditional Newton’s method and another third-order convergent method. The results demonstrate that the INM method offers superior characteristics in terms of the contour of the convergence region and the complexity of the boundary compared to the other methods.
Barintag Saheya, Tugal Zhanlav, Jein-Shan Chen
Soft Comput.4
2025 Smoothing penalty approach for solving second-order cone complementarity problems
Chieu Thanh Nguyen, Jan Harold Alcantara, Zijun Hao, Jein-Shan Chen
J. Glob. Optim.4
2022 An approximate lower order penalty approach for solving second-order cone linear complementarity problems
Zijun Hao, Chieu Thanh Nguyen, Jein-Shan Chen
J. Glob. Optim.3
2021 A Neural Network Based on the Metric Projector for Solving SOCCVI Problem
abstract
We propose an efficient neural network for solving the second-order cone constrained variational inequality (SOCCVI). The network is constructed using the Karush-Kuhn-Tucker (KKT) conditions of the variational inequality (VI), which is used to recast the SOCCVI as a system of equations by using a smoothing function for the metric projection mapping to deal with the complementarity condition. Aside from standard stability results, we explore second-order sufficient conditions to obtain exponential stability. Especially, we prove the nonsingularity of the Jacobian of the KKT system based on the second-order sufficient condition and constraint nondegeneracy. Finally, we present some numerical experiments, illustrating the efficiency of the neural network in solving SOCCVI problems. Our numerical simulations reveal that, in general, the new neural network is more dominant than all other neural networks in the SOCCVI literature in terms of stability and convergence rates of trajectories to SOCCVI solution.
Juhe Sun, Weichen Fu, Jan Harold Alcantara, Jein-Shan Chen
IEEE Trans. Neural Networks Learn. Syst.4
2020 A novel generalization of the natural residual function and a neural network approach for the NCP
Jan Harold Alcantara, Jein-Shan Chen
Neurocomputing2
2020 The decompositions with respect to two core non-symmetric cones
Ching-Yu Yang, Jein-Shan Chen, Houduo Qi
J. Glob. Optim.3
2019 Neural networks based on three classes of NCP-functions for solving nonlinear complementarity problems
Jan Harold Alcantara, Jein-Shan Chen
Neurocomputing2
2016 A neural network based on the generalized FB function for nonlinear convex programs with second-order cone constraints
Xinhe Miao, Jein-Shan Chen, Chun-Hsu Ko
Neurocomputing2
2015 On the existence of saddle points for nonlinear second-order cone programming problems
Jinchuan Zhou, Jein-Shan Chen
J. Glob. Optim.2
2015 The H-differentiability and calmness of circular cone functions
Jinchuan Zhou, Yu-Lin Chang, Jein-Shan Chen
J. Glob. Optim.3
2014 A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints
Xinhe Miao, Jein-Shan Chen, Chun-Hsu Ko
Inf. Sci.2
2011 Recurrent neural networks for solving second-order cone programs
Chun-Hsu Ko, Jein-Shan Chen, Ching-Yu Yang
Neurocomputing2
2011 A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
Jein-Shan Chen, Shaohua Pan 0001, Chun-Hsu Ko
J. Glob. Optim.1
2010 A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems
Jein-Shan Chen, Chun-Hsu Ko, Shaohua Pan 0001
Inf. Sci.1
2009 Some characterizations for SOC-monotone and SOC-convex functions
Jein-Shan Chen, Xin Chen 0093, Shaohua Pan 0001
J. Glob. Optim.1
2007 Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
Shaohua Pan 0001, Jein-Shan Chen
J. Glob. Optim.2
2006 The Semismooth-Related Properties of a Merit Function and a Descent Method for the Nonlinear Complementarity Problem
Jein-Shan Chen
J. Glob. Optim.1