default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJein-Shan Chen
Person information
- affiliation: National Taiwan Normal University, Taipei, Taiwan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j54]Shun-Wei Li, Yu-Lin Chang
, Jein-Shan Chen:
Plane Section Curves on Surfaces of NCP Functions. Axioms 11(10): 557 (2022)- [j53]Jan Harold Alcantara, Jein-Shan Chen:
A new class of neural networks for NCPs using smooth perturbations of the natural residual function. J. Comput. Appl. Math. 407: 114092 (2022) - [j52]Zijun Hao, Chieu Thanh Nguyen, Jein-Shan Chen:
An approximate lower order penalty approach for solving second-order cone linear complementarity problems. J. Glob. Optim. 83(4): 671-697 (2022) - [j51]Jian Shen, Jein-Shan Chen, Hou-Duo Qi, Naihua Xiu:
A penalized method of alternating projections for weighted low-rank hankel matrix optimization. Math. Program. Comput. 14(3): 417-450 (2022) - 2021
- [j50]Caiying Wu, Jing Wang, Jan Harold Alcantara, Jein-Shan Chen:
Smoothing Strategy Along with Conjugate Gradient Algorithm for Signal Reconstruction. J. Sci. Comput. 87(1): 21 (2021) - [j49]Juhe Sun, Weichen Fu, Jan Harold Alcantara, Jein-Shan Chen:
A Neural Network Based on the Metric Projector for Solving SOCCVI Problem. IEEE Trans. Neural Networks Learn. Syst. 32(7): 2886-2900 (2021) - [i1]Jan Harold Alcantara, Jein-Shan Chen, Matthew K. Tam:
Method of Alternating Projection for the Absolute Value Equation. CoRR abs/2106.03268 (2021) - 2020
- [j48]Jan Harold Alcantara, Jein-Shan Chen:
A novel generalization of the natural residual function and a neural network approach for the NCP. Neurocomputing 413: 368-382 (2020) - [j47]Yue Lu, Ching-Yu Yang, Jein-Shan Chen, Hou-Duo Qi:
The decompositions with respect to two core non-symmetric cones. J. Glob. Optim. 76(1): 155-188 (2020) - [j46]Jan Harold Alcantara, Chen-Han Lee, Chieu Thanh Nguyen, Yu-Lin Chang, Jein-Shan Chen:
On construction of new NCP functions. Oper. Res. Lett. 48(2): 115-121 (2020)
2010 – 2019
- 2019
- [j45]Jan Harold Alcantara, Jein-Shan Chen:
Neural networks based on three classes of NCP-functions for solving nonlinear complementarity problems. Neurocomputing 359: 102-113 (2019) - [j44]B. Saheya, Chieu Thanh Nguyen, Jein-Shan Chen:
Neural network based on systematically generated smoothing functions for absolute value equation. J. Appl. Math. Comput. 61(1-2): 533-558 (2019) - [j43]Jein-Shan Chen, Jane J. Ye, Jin Zhang, Jinchuan Zhou:
Exact Formula for the Second-Order Tangent Set of the Second-Order Cone Complementarity Set. SIAM J. Optim. 29(4): 2986-3011 (2019) - 2018
- [j42]Weizhe Gu, Wei-Po Chen, Chun-Hsu Ko, Yuh-Jye Lee, Jein-Shan Chen:
Two smooth support vector machines for \(\varepsilon \) -insensitive regression. Comput. Optim. Appl. 70(1): 171-199 (2018) - 2017
- [j41]Xinhe Miao, Yu-Lin Chang, Jein-Shan Chen:
On merit functions for p-order cone complementarity problem. Comput. Optim. Appl. 67(1): 155-173 (2017) - [j40]Jinchuan Zhou, Jingyong Tang, Jein-Shan Chen:
Parabolic Second-Order Directional Differentiability in the Hadamard Sense of the Vector-Valued Functions Associated with Circular Cones. J. Optim. Theory Appl. 172(3): 802-823 (2017) - [j39]Xinhe Miao, Yen-Chi Roger Lin, Jein-Shan Chen:
A Note on the Paper "The Algebraic Structure of the Arbitrary-Order Cone". J. Optim. Theory Appl. 173(3): 1066-1070 (2017) - [j38]Chien-Hao Huang, Jein-Shan Chen, Juan Enrique Martínez-Legaz:
Differentiability v.s. convexity for complementarity functions. Optim. Lett. 11(1): 209-216 (2017) - 2016
- [j37]Xinhe Miao, Shengjuan Guo, Nuo Qi, Jein-Shan Chen:
Constructions of complementarity functions and merit functions for circular cone complementarity problem. Comput. Optim. Appl. 63(2): 495-522 (2016) - [j36]Xinhe Miao, Jein-Shan Chen, Chun-Hsu Ko:
A neural network based on the generalized FB function for nonlinear convex programs with second-order cone constraints. Neurocomputing 203: 62-72 (2016) - 2015
- [j35]Jinchuan Zhou, Jein-Shan Chen:
On the existence of saddle points for nonlinear second-order cone programming problems. J. Glob. Optim. 62(3): 459-480 (2015) - [j34]Jinchuan Zhou, Yu-Lin Chang, Jein-Shan Chen:
The H-differentiability and calmness of circular cone functions. J. Glob. Optim. 63(4): 811-833 (2015) - [j33]Xinhe Miao, Jein-Shan Chen:
Characterizations of solution sets of cone-constrained convex programming problems. Optim. Lett. 9(7): 1433-1445 (2015) - [j32]Yu-Lin Chang, Jein-Shan Chen, Ching-Yu Yang:
Symmetrization of generalized natural residual function for NCP. Oper. Res. Lett. 43(4): 354-358 (2015) - 2014
- [j31]Huai-Yin Tsai, Jein-Shan Chen:
Geometric views of the generalized Fischer-Burmeister function and its induced merit function. Appl. Math. Comput. 237: 31-59 (2014) - [j30]Xinhe Miao, Jein-Shan Chen, Chun-Hsu Ko:
A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints. Inf. Sci. 268: 255-270 (2014) - [j29]Shaohua Pan, Sangho Kum, Yongdo Lim, Jein-Shan Chen:
On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem. Math. Comput. 83(287): 1143-1171 (2014) - 2012
- [j28]Jein-Shan Chen, Jing-Fan Li, Jia Wu:
A continuation approach for solving binary quadratic program based on a class of NCP-functions. Appl. Math. Comput. 219(8): 3975-3992 (2012) - [j27]Juhe Sun, Jein-Shan Chen, Chun-Hsu Ko:
Neural networks for solving second-order cone constrained variational inequality problem. Comput. Optim. Appl. 51(2): 623-648 (2012) - [j26]Jia Wu, Jein-Shan Chen:
A proximal point algorithm for the monotone second-order cone complementarity problem. Comput. Optim. Appl. 51(3): 1037-1063 (2012) - [j25]Shujun Bi, Shaohua Pan, Jein-Shan Chen:
The same growth of FB and NR symmetric cone complementarity functions. Optim. Lett. 6(1): 153-162 (2012) - 2011
- [j24]Shaohua Pan, Jein-Shan Chen, Sangho Kum, Yongdo Lim:
The penalized Fischer-Burmeister SOC complementarity function. Comput. Optim. Appl. 49(3): 457-491 (2011) - [j23]Jein-Shan Chen, Zheng-Hai Huang, Chin-Yu She:
A new class of penalized NCP-functions and its properties. Comput. Optim. Appl. 50(1): 49-73 (2011) - [j22]Chun-Hsu Ko, Jein-Shan Chen, Ching-Yu Yang:
Recurrent neural networks for solving second-order cone programs. Neurocomputing 74(17): 3646-3653 (2011) - [j21]Jein-Shan Chen, Shaohua Pan, Chun-Hsu Ko:
A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation. J. Glob. Optim. 50(4): 713-728 (2011) - [j20]Shaohua Pan, Jein-Shan Chen:
A least-square semismooth Newton method for the second-order cone complementarity problem. Optim. Methods Softw. 26(1): 1-22 (2011) - [j19]Shujun Bi, Shaohua Pan, Jein-Shan Chen:
Nonsingularity Conditions for the Fischer-Burmeister System of Nonlinear SDPs. SIAM J. Optim. 21(4): 1392-1417 (2011) - 2010
- [j18]Shaohua Pan, Jein-Shan Chen:
A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions. Comput. Optim. Appl. 45(1): 59-88 (2010) - [j17]Jein-Shan Chen, Shaohua Pan:
A one-parametric class of merit functions for the second-order cone complementarity problem. Comput. Optim. Appl. 45(3): 581-606 (2010) - [j16]Jein-Shan Chen, Shaohua Pan:
An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming. Comput. Optim. Appl. 47(3): 477-499 (2010) - [j15]Jein-Shan Chen, Chun-Hsu Ko, Shaohua Pan:
A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems. Inf. Sci. 180(5): 697-711 (2010) - [j14]Jein-Shan Chen, Shaohua Pan, Ching-Yu Yang:
Numerical comparisons of two effective methods for mixed complementarity problems. J. Comput. Appl. Math. 234(3): 667-683 (2010) - [j13]Shaohua Pan, Yu-Lin Chang, Jein-Shan Chen:
Stationary point conditions for the FB merit function associated with symmetric cones. Oper. Res. Lett. 38(5): 372-377 (2010)
2000 – 2009
- 2009
- [j12]Jein-Shan Chen, Hung-Ta Gao, Shaohua Pan:
An R-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function. J. Comput. Appl. Math. 232(2): 455-471 (2009) - [j11]Jein-Shan Chen, Xin Chen, Shaohua Pan, Jiawei Zhang:
Some characterizations for SOC-monotone and SOC-convex functions. J. Glob. Optim. 45(2): 259-279 (2009) - 2008
- [j10]Jein-Shan Chen, Shaohua Pan:
A family of NCP functions and a descent method for the nonlinear complementarity problem. Comput. Optim. Appl. 40(3): 389-404 (2008) - [j9]Jein-Shan Chen, Defeng Sun, Jie Sun:
The SC1 property of the squared norm of the SOC Fischer-Burmeister function. Oper. Res. Lett. 36(3): 385-392 (2008) - [j8]Shaohua Pan, Jein-Shan Chen:
A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming. SIAM J. Optim. 19(2): 883-910 (2008) - 2007
- [j7]Shaohua Pan, Jein-Shan Chen:
Two unconstrained optimization approaches for the Euclidean kappa-centrum location problem. Appl. Math. Comput. 189(2): 1368-1383 (2007) - [j6]Jein-Shan Chen:
On Some NCP-Functions Based on the Generalized Fischer-burmeister Function. Asia Pac. J. Oper. Res. 24(3): 401-420 (2007) - [j5]Shaohua Pan, Jein-Shan Chen:
Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming. J. Glob. Optim. 39(4): 555-575 (2007) - 2006
- [j4]Jein-Shan Chen:
The Semismooth-Related Properties of a Merit Function and a Descent Method for the Nonlinear Complementarity Problem. J. Glob. Optim. 36(4): 565-580 (2006) - [j3]Jein-Shan Chen:
Two classes of merit functions for the second-order cone complementarity problem. Math. Methods Oper. Res. 64(3): 495-519 (2006) - 2005
- [j2]Jein-Shan Chen, Paul Tseng:
An unconstrained smooth minimization reformulation of the second-order cone complementarity problem. Math. Program. 104(2-3): 293-327 (2005) - 2004
- [j1]Jein-Shan Chen, Xin Chen, Paul Tseng:
Analysis of nonsmooth vector-valued functions associated with second-order cones. Math. Program. 101(1): 95-117 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
