![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Yinghong Xu
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j11]Gang Li, Yinghong Xu, Zhenhua Qin:
Fenchel-Lagrange duality for DC infinite programs with inequality constraints. J. Comput. Appl. Math. 391: 113426 (2021)
2010 – 2019
- 2019
- [j10]Tingyue Li, Qifeng Zhang
, Wahidullah Niazi, Yinghong Xu, Maohua Ran:
An Effective Algorithm for Delay Fractional Convection-Diffusion Wave Equation Based on Reversible Exponential Recovery Method. IEEE Access 7: 5554-5563 (2019) - [j9]Qifeng Zhang
, Yunzhu Ren, Xiaoman Lin, Yinghong Xu:
Uniform convergence of compact and BDF methods for the space fractional semilinear delay reaction-diffusion equations. Appl. Math. Comput. 358: 91-110 (2019) - 2018
- [j8]Qifeng Zhang
, Mengzhe Chen, Yinghong Xu, Dinghua Xu:
Compact θ-method for the generalized delay diffusion equation. Appl. Math. Comput. 316: 357-369 (2018) - 2013
- [j7]Lipu Zhang
, Yanqin Bai, Yinghong Xu:
A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function. Optim. Methods Softw. 28(3): 619-639 (2013) - 2012
- [j6]Lipu Zhang
, Yinghong Xu, Yousong Liu:
An Elite Decision Making Harmony Search Algorithm for Optimization Problem. J. Appl. Math. 2012: 860681:1-860681:15 (2012) - [j5]Lipu Zhang
, Yanqin Bai, Yinghong Xu:
A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function. Numer. Algorithms 61(1): 57-81 (2012) - 2011
- [j4]Lipu Zhang
, Yinghong Xu:
A new infeasible interior-point algorithm with full step for linear optimization based on a simple function. Int. J. Comput. Math. 88(15): 3163-3185 (2011) - [j3]Lipu Zhang
, Yinghong Xu:
A Modified-Newton Step Primal-dual Interior Point Algorithm for Linear Complementarity Problems. J. Softw. 6(10): 2023-2028 (2011) - [j2]Lipu Zhang
, Yinghong Xu:
A full-Newton step interior-point algorithm based on modified-Newton direction. J. Softw. 6(10): 2029-2035 (2011) - [j1]Lipu Zhang
, Yinghong Xu:
A full-Newton step interior-point algorithm based on modified Newton direction. Oper. Res. Lett. 39(5): 318-322 (2011)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08 21:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint