default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYun-Bin Zhao
Person information
- affiliation: University of Birmingham, UK
- affiliation: Chinese Academy of Sciences, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j36]Zhong-Feng Sun
, Jin-Chuan Zhou, Yun-Bin Zhao, Nan Meng:
Heavy-ball-based hard thresholding algorithms for sparse signal recovery. J. Comput. Appl. Math. 430: 115264 (2023)- [j35]Zai-Yun Peng, Xue-Jing Chen, Yun-Bin Zhao, Xiao-Bing Li:
Painlevé-Kuratowski convergence of minimal solutions for set-valued optimization problems via improvement sets. J. Glob. Optim. 87(2): 759-781 (2023) - [j34]Zhong-Feng Sun, Jin-Chuan Zhou, Yun-Bin Zhao:
Heavy-Ball-Based Optimal Thresholding Algorithms for Sparse Linear Inverse Problems. J. Sci. Comput. 96(3): 93 (2023) - [i12]Zhong-Feng Sun, Jin-Chuan Zhou, Yun-Bin Zhao:
Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems. CoRR abs/2305.03247 (2023) - 2022
- [j33]Nan Meng, Yun-Bin Zhao, Michal Kocvara, Zhong-Feng Sun:
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems. J. Glob. Optim. 84(2): 393-413 (2022) - [i11]Zhong-Feng Sun, Jin-Chuan Zhou, Yun-Bin Zhao, Nan Meng:
Heavy-Ball-Based Hard Thresholding Algorithms for Sparse Signal Recovery. CoRR abs/2204.09300 (2022) - [i10]Yun-Bin Zhao, Zhi-Quan Luo:
Natural Thresholding Algorithms for Signal Recovery with Sparsity. CoRR abs/2207.09622 (2022) - 2021
- [j32]Jialiang Xu, Yun-Bin Zhao:
Dual-density-based reweighted ℓ 1-algorithms for a class of ℓ 0-minimization problems. J. Glob. Optim. 81(3): 749-772 (2021) - [j31]Yun-Bin Zhao, Zhi-Quan Luo:
Analysis of optimal thresholding algorithms for compressed sensing. Signal Process. 187: 108148 (2021) - [i9]Yun-Bin Zhao, Zhi-Quan Luo:
Dynamic Orthogonal Matching Pursuit for Signal Reconstruction. CoRR abs/2108.09892 (2021) - 2020
- [j30]Jialiang Xu, Yun-Bin Zhao:
Stability analysis of a class of sparse optimization problems. Optim. Methods Softw. 35(4): 836-854 (2020) - [j29]Yun-Bin Zhao:
Optimal k-Thresholding Algorithms for Sparse Optimization Problems. SIAM J. Optim. 30(1): 31-55 (2020) - [j28]Nan Meng, Yun-Bin Zhao:
Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery. IEEE Trans. Signal Process. 68: 6594-6606 (2020) - [i8]Jialiang Xu, Yun-Bin Zhao:
Dual-density-based reweighted 𝓁1-algorithms for a class of 𝓁0-minimization problems. CoRR abs/2003.13047 (2020)
2010 – 2019
- 2019
- [j27]Yun-Bin Zhao, Houyuan Jiang, Zhi-Quan Luo:
Weak Stability of ℓ1-Minimization Methods in Sparse Data Reconstruction. Math. Oper. Res. 44(1): 173-195 (2019) - [i7]Jialiang Xu, Yun-Bin Zhao:
Stability Analysis for a Class of Sparse Optimization Problems. CoRR abs/1904.09637 (2019) - [i6]Yun-Bin Zhao:
Optimal k-thresholding algorithms for sparse optimization problems. CoRR abs/1909.00717 (2019) - [i5]Yun-Bin Zhao, Zhi-Quan Luo:
Analysis of Optimal Thresholding Algorithms for Compressed Sensing. CoRR abs/1912.10258 (2019) - 2017
- [j26]Yun-Bin Zhao, Zhi-Quan Luo:
Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets. Math. Oper. Res. 42(1): 57-76 (2017) - [i4]Yun-Bin Zhao, Houyuan Jiang, Zhi-Quan Luo:
Weak Stability of ࡁ1-minimization Methods in Sparse Data Reconstruction. CoRR abs/1710.10883 (2017) - 2015
- [j25]Chunlei Xu, Yun-Bin Zhao:
Uniqueness Conditions for A Class of ℓ0-Minimization Problems. Asia Pac. J. Oper. Res. 32(1): 1540002:1-1540002:17 (2015) - [j24]Hai-Bin Zhang, Jiao-Jiao Jiang, Yun-Bin Zhao:
On the proximal Landweber Newton method for a class of nonsmooth convex problems. Comput. Optim. Appl. 61(1): 79-99 (2015) - [j23]Yun-Bin Zhao, Michal Kocvara:
A New Computational Method for the Sparsest Solutions to Systems of Linear Equations. SIAM J. Optim. 25(2): 1110-1134 (2015) - 2014
- [i3]Yun-Bin Zhao, Chunlei Xu:
1-Bit Compressive Sensing: Reformulation and RRSP-Based Recovery Theory. CoRR abs/1412.5514 (2014) - 2013
- [j22]Yun-Bin Zhao, Masao Fukushima:
Rank-one solutions for homogeneous linear matrix equations over the positive semidefinite cone. Appl. Math. Comput. 219(10): 5569-5583 (2013) - [j21]Yun-Bin Zhao:
New and improved conditions for uniqueness of sparsest solutions of underdetermined linear systems. Appl. Math. Comput. 224: 58-73 (2013) - [j20]Yun-Bin Zhao:
RSP-Based Analysis for Sparsest and Least ℓ1-Norm Solutions to Underdetermined Linear Systems. IEEE Trans. Signal Process. 61(22): 5777-5788 (2013) - [i2]Yun-Bin Zhao:
RSP-Based Analysis for Sparsest and Least ℓ1-Norm Solutions to Underdetermined Linear Systems. CoRR abs/1307.4579 (2013) - [i1]Chunlei Xu, Yun-Bin Zhao:
Uniqueness Conditions for A Class of l0-Minimization Problems. CoRR abs/1312.4280 (2013) - 2012
- [j19]Yun-Bin Zhao, Duan Li:
Reweighted 1-Minimization for Sparse Solutions to Underdetermined Linear Systems. SIAM J. Optim. 22(3): 1065-1088 (2012) - 2011
- [j18]Yun-Bin Zhao:
Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities. J. Comput. Appl. Math. 235(15): 4389-4403 (2011) - [j17]Igor Averbakh, Yun-Bin Zhao:
Robust univariate spline models for interpolating interval data. Oper. Res. Lett. 39(1): 62-66 (2011) - 2010
- [j16]Yun-Bin Zhao:
The Legendre-Fenchel Conjugate of the Product of Two Positive Definite Quadratic Forms. SIAM J. Matrix Anal. Appl. 31(4): 1792-1811 (2010)
2000 – 2009
- 2009
- [j15]Igor Averbakh, Yun-Bin Zhao:
Relaxed robust second-order-cone programming. Appl. Math. Comput. 210(2): 387-397 (2009) - 2008
- [j14]Yun-Bin Zhao, Shu-Cherng Fang, John E. Lavery:
Geometric dual formulation for first-derivative-based univariate cubic L 1 splines. J. Glob. Optim. 40(4): 589-621 (2008) - [j13]Igor Averbakh, Yun-Bin Zhao:
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets. SIAM J. Optim. 18(4): 1436-1466 (2008) - 2007
- [j12]Yun-Bin Zhao, Jie Hu:
Global bounds for the distance to solutions of co-coercive variational inequalities. Oper. Res. Lett. 35(3): 409-415 (2007) - 2006
- [j11]Yun-Bin Zhao, Duan Li:
A New Path-Following Algorithm for Nonlinear P*Complementarity Problems. Comput. Optim. Appl. 34(2): 183-214 (2006) - [j10]Yun-Bin Zhao, Shu-Cherng Fang, Duan Li:
Constructing Generalized Mean Functions Using Convex Functions with Regularity Conditions. SIAM J. Optim. 17(1): 37-51 (2006) - 2004
- [j9]Yun-Bin Zhao, Gong-Nong Li:
Properties of a homotopy solution path for complementarity problems with quasi-monotone mappings. Appl. Math. Comput. 148(1): 93-104 (2004) - 2003
- [j8]Yun-Bin Zhao, Duan Li:
A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P[sub 0] LCPs. SIAM J. Optim. 13(4): 1195-1221 (2003) - 2002
- [j7]Yun-Bin Zhao, Duan Li:
Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method. SIAM J. Optim. 12(4): 893-912 (2002) - 2001
- [j6]Yun-Bin Zhao, Duan Li:
On a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems. Math. Oper. Res. 26(1): 119-146 (2001) - [j5]Yun-Bin Zhao, Duan Li:
Existence and Limiting Behavior of a Non--Interior-Point Trajectory for Nonlinear Complementarity Problems Without Strict Feasibility Condition. SIAM J. Control. Optim. 40(3): 898-924 (2001) - [j4]Yun-Bin Zhao, Duan Li:
Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application. SIAM J. Optim. 11(4): 962-973 (2001) - 2000
- [j3]Yun-Bin Zhao, Jin-Yun Yuan:
An alternative theorem for generalized variational inequalities and solvability of nonlinear quasi-PM*-complementarity problems. Appl. Math. Comput. 109(2-3): 167-182 (2000) - [j2]Yun-Bin Zhao, George Isac:
Properties of a Multivalued Mapping Associated with Some Nonmonotone Complementarity Problems. SIAM J. Control. Optim. 39(2): 571-593 (2000)
1990 – 1999
- 1999
- [j1]Yun-Bin Zhao:
D-orientation sequences for continuous functions and nonlinear complementarity problems. Appl. Math. Comput. 106(2-3): 221-235 (1999)
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 23:21 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:
