default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAn-ping Liao
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j16]Xiaobo Yang, An-ping Liao, Jiaxin Xie:
A remark on joint sparse recovery with OMP algorithm under restricted isometry property. Appl. Math. Comput. 316: 18-24 (2018)- [j15]Jiaxin Xie, An-ping Liao, Yuan Lei:
A new accelerated alternating minimization method for analysis sparse recovery. Signal Process. 145: 167-174 (2018) - 2017
- [j14]Jiaxin Xie, An-ping Liao, Xiaobo Yang:
An inexact alternating direction method of multipliers with relative error criteria. Optim. Lett. 11(3): 583-596 (2017) - 2015
- [j13]An-ping Liao, Xiaobo Yang, Jiaxin Xie, Yuan Lei:
Analysis of convergence for the alternating direction method applied to joint sparse recovery. Appl. Math. Comput. 269: 548-557 (2015) - 2014
- [j12]Shifang Yuan, An-ping Liao:
Least squares Hermitian solution of the complex matrix equation AXB+CXD=E with the least norm. J. Frankl. Inst. 351(11): 4978-4997 (2014) - 2013
- [j11]Xuefeng Duan, Chunmei Li, An-ping Liao, Ronghao Wang:
On two classes of mixed-type Lyapunov equations. Appl. Math. Comput. 219(16): 8486-8495 (2013) - 2012
- [j10]Shifang Yuan, An-ping Liao, Guozhu Yao:
Parameterized inverse singular value problem for anti-bisymmetric matrices. Numer. Algorithms 60(3): 501-522 (2012) - 2011
- [j9]Xuefeng Duan, Chunmei Li, An-ping Liao:
Solutions and perturbation analysis for the nonlinear matrix equation X + Σmi=1Ai*X-1Ai = I. Appl. Math. Comput. 218(8): 4458-4466 (2011) - [j8]Guozhu Yao, An-ping Liao, Xuefeng Duan:
Positive definite solution of the matrix equation X=Q+AH(IÄX-C)dA. Numer. Algorithms 56(3): 349-361 (2011) - 2010
- [j7]An-ping Liao, Guozhu Yao, Xue-Feng Duan:
Thompson metric method for solving a class of nonlinear matrix equation. Appl. Math. Comput. 216(6): 1831-1836 (2010)
2000 – 2009
- 2009
- [j6]Xue-Feng Duan, An-ping Liao:
On the nonlinear matrix equation X+A*X-qA=Q(q≥1). Math. Comput. Model. 49(5-6): 936-945 (2009) - 2008
- [j5]Shifang Yuan, An-ping Liao, Yuan Lei:
Inverse eigenvalue problems of tridiagonal symmetric matrices and tridiagonal bisymmetric matrices. Comput. Math. Appl. 55(11): 2521-2532 (2008) - [j4]Shifang Yuan, An-ping Liao, Yuan Lei:
Least squares Hermitian solution of the matrix equation (AXB, CXD) = (E, F) with the least norm over the skew field of quaternions. Math. Comput. Model. 48(1-2): 91-100 (2008) - 2007
- [j3]Yuan Lei, An-ping Liao:
A minimal residual algorithm for the inconsistent matrix equation AXB=C over symmetric matrices. Appl. Math. Comput. 188(1): 499-513 (2007) - [j2]An-ping Liao, Yuan Lei:
Least-squares solutions of matrix inverse problem for bi-symmetric matrices with a submatrix constraint. Numer. Linear Algebra Appl. 14(5): 425-444 (2007) - 2005
- [j1]An-ping Liao, Zhong-Zhi Bai, Yuan Lei:
Best Approximate Solution of Matrix Equation AXB+CYD=E. SIAM J. Matrix Anal. Appl. 27(3): 675-688 (2005)
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-04-24 22:57 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:
