Jein-Shan Chen
Orcid: 0000-0002-4596-9419Affiliations:
- National Taiwan Normal University, Taipei, Taiwan
According to our database1,
Jein-Shan Chen
authored at least 56 papers
between 2004 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
J. Glob. Optim., January, 2025
2022
A penalized method of alternating projections for weighted low-rank hankel matrix optimization.
Math. Program. Comput., 2022
An approximate lower order penalty approach for solving second-order cone linear complementarity problems.
J. Glob. Optim., 2022
A new class of neural networks for NCPs using smooth perturbations of the natural residual function.
J. Comput. Appl. Math., 2022
2021
IEEE Trans. Neural Networks Learn. Syst., 2021
Smoothing Strategy Along with Conjugate Gradient Algorithm for Signal Reconstruction.
J. Sci. Comput., 2021
2020
J. Glob. Optim., 2020
A novel generalization of the natural residual function and a neural network approach for the NCP.
Neurocomputing, 2020
2019
Neural network based on systematically generated smoothing functions for absolute value equation.
J. Appl. Math. Comput., October, 2019
Exact Formula for the Second-Order Tangent Set of the Second-Order Cone Complementarity Set.
SIAM J. Optim., 2019
Neural networks based on three classes of NCP-functions for solving nonlinear complementarity problems.
Neurocomputing, 2019
2018
Comput. Optim. Appl., 2018
2017
Parabolic Second-Order Directional Differentiability in the Hadamard Sense of the Vector-Valued Functions Associated with Circular Cones.
J. Optim. Theory Appl., 2017
J. Optim. Theory Appl., 2017
Comput. Optim. Appl., 2017
2016
A neural network based on the generalized FB function for nonlinear convex programs with second-order cone constraints.
Neurocomputing, 2016
Constructions of complementarity functions and merit functions for circular cone complementarity problem.
Comput. Optim. Appl., 2016
2015
Oper. Res. Lett., 2015
Optim. Lett., 2015
J. Glob. Optim., 2015
On the existence of saddle points for nonlinear second-order cone programming problems.
J. Glob. Optim., 2015
2014
On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem.
Math. Comput., 2014
A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints.
Inf. Sci., 2014
Geometric views of the generalized Fischer-Burmeister function and its induced merit function.
Appl. Math. Comput., 2014
2012
Optim. Lett., 2012
A proximal point algorithm for the monotone second-order cone complementarity problem.
Comput. Optim. Appl., 2012
Neural networks for solving second-order cone constrained variational inequality problem.
Comput. Optim. Appl., 2012
A continuation approach for solving binary quadratic program based on a class of NCP-functions.
Appl. Math. Comput., 2012
2011
SIAM J. Optim., 2011
A least-square semismooth Newton method for the second-order cone complementarity problem.
Optim. Methods Softw., 2011
A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation.
J. Glob. Optim., 2011
Neurocomputing, 2011
Comput. Optim. Appl., 2011
Comput. Optim. Appl., 2011
2010
Stationary point conditions for the FB merit function associated with symmetric cones.
Oper. Res. Lett., 2010
J. Comput. Appl. Math., 2010
A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems.
Inf. Sci., 2010
A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions.
Comput. Optim. Appl., 2010
A one-parametric class of merit functions for the second-order cone complementarity problem.
Comput. Optim. Appl., 2010
An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming.
Comput. Optim. Appl., 2010
2009
J. Glob. Optim., 2009
An R-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function.
J. Comput. Appl. Math., 2009
2008
A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming.
SIAM J. Optim., 2008
The SC<sup>1</sup> property of the squared norm of the SOC Fischer-Burmeister function.
Oper. Res. Lett., 2008
A family of NCP functions and a descent method for the nonlinear complementarity problem.
Comput. Optim. Appl., 2008
2007
Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming.
J. Glob. Optim., 2007
Asia Pac. J. Oper. Res., 2007
Two unconstrained optimization approaches for the Euclidean kappa-centrum location problem.
Appl. Math. Comput., 2007
2006
Math. Methods Oper. Res., 2006
The Semismooth-Related Properties of a Merit Function and a Descent Method for the Nonlinear Complementarity Problem.
J. Glob. Optim., 2006
2005
An unconstrained smooth minimization reformulation of the second-order cone complementarity problem.
Math. Program., 2005
2004
Math. Program., 2004