default search action
Ping-Fan Dai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Li-Ming Li, Shi-Liang Wu, Ping-Fan Dai:
Global Error Bound for the Vertical Tensor Complementarity Problem. J. Optim. Theory Appl. 200(3): 1056-1077 (2024) - [j19]Li-Ming Li, Shi-Liang Wu, Ping-Fan Dai:
Some Perturbation Bounds of the Tensor Complementarity Problem. J. Optim. Theory Appl. 201(2): 825-842 (2024) - [j18]Ping-Fan Dai, Jianchao Bai, Jicheng Li:
A General Preconditioner for Tensor Complementarity Problems. J. Sci. Comput. 98(1): 3 (2024) - [j17]Ping-Fan Dai, Shi-Liang Wu:
A projected splitting method for vertical tensor complementarity problems. Optim. Lett. 18(4): 1005-1021 (2024) - 2023
- [j16]Ping-Fan Dai, Jinping Li, Shaoyu Zhao:
Infinity norm bounds for the inverse for $$\textrm{GSDD}_1$$ matrices using scaling matrices. Comput. Appl. Math. 42(3) (2023) - 2022
- [j15]Ping-Fan Dai, Shi-Liang Wu:
The GUS-Property and Modulus-Based Methods for Tensor Complementarity Problems. J. Optim. Theory Appl. 195(3): 976-1006 (2022) - 2020
- [j14]Ping-Fan Dai:
A Fixed Point Iterative Method for Tensor Complementarity Problems. J. Sci. Comput. 84(3): 49 (2020)
2010 – 2019
- 2019
- [j13]Ping-Fan Dai
, Jicheng Li, Jianchao Bai
A preconditioned two-step modulus-based matrix splitting iteration method for linear complementarity problem. Appl. Math. Comput. 348: 542-551 (2019) - [j12]Ping-Fan Dai, Jicheng Li, Jianchao Bai
New error bounds for linear complementarity problems of S-Nekrasov matrices and B-S-Nekrasov matrices. Comput. Appl. Math. 38(2) (2019) - [j11]Jianchao Bai
General parameterized proximal point algorithm with applications in statistical learning. Int. J. Comput. Math. 96(1): 199-215 (2019) - 2018
- [j10]Jianchao Bai
A novel method for a class of structured low-rank minimizations with equality constraint. J. Comput. Appl. Math. 330: 475-487 (2018) - 2017
- [j9]Ping-Fan Dai
A general preconditioner for linear complementarity problem with an M-matrix. J. Comput. Appl. Math. 317: 100-112 (2017) - [j8]Zisheng Liu, Jicheng Li, Wenbo Li, Pingfan Dai:
A modified greedy analysis pursuit algorithm for the cosparse analysis model. Numer. Algorithms 74(3): 867-887 (2017) - [j7]Chaoqian Li
New error bounds for linear complementarity problems of Nekrasov matrices and B-Nekrasov matrices. Numer. Algorithms 74(4): 997-1009 (2017) - 2016
- [j6]Ping-Fan Dai:
A note on diagonal dominance, Schur complements and some classes of H-matrices and P-matrices. Adv. Comput. Math. 42(1): 1-4 (2016) - 2013
- [j5]Ljiljana Cvetkovic
Infinity norm bounds for the inverse of Nekrasov matrices. Appl. Math. Comput. 219(10): 5020-5024 (2013) - [j4]Ping-Fan Dai, Chang-Jing Lu, Yao-Tang Li:
New error bounds for the linear complementarity problem with an SB-matrix. Numer. Algorithms 64(4): 741-757 (2013) - 2012
- [j3]Ping-Fan Dai, Yao-Tang Li, Chang-Jing Lu:
Error bounds for linear complementarity problems for SB-matrices. Numer. Algorithms 61(1): 121-139 (2012) - [j2]Ping-Fan Dai, Yao-Tang Li, Chang-Jing Lu:
Erratum to: Error bounds for linear complementarity problems for SB-matrices. Numer. Algorithms 61(1): 187 (2012)
2000 – 2009
- 2007
- [j1]Yaotang Li, Pingfan Dai:
Generalized AOR methods for linear complementarity problem. Appl. Math. Comput. 188(1): 7-18 (2007)
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-05-14 20:25 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: