default search action
Shujun Bi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Shujun Bi
, Lan Zhou, Shaohua Pan
Sparse Signal Reconstruction: Sequential Convex Relaxation, Restricted Null Space Property, and Error Bounds. IEEE Trans. Inf. Theory 70(11): 8378-8398 (2024) - 2023
- [j21]Yitian Qian, Shaohua Pan, Shujun Bi:
A matrix nonconvex relaxation approach to unconstrained binary polynomial programs. Comput. Optim. Appl. 84(3): 875-919 (2023) - [j20]Dongdong Zhang, Shaohua Pan, Shujun Bi, Defeng Sun:
Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound. Comput. Optim. Appl. 86(2): 627-667 (2023) - [j19]Shujun Bi, Zhen Yin, Yihong Weng:
A low-rank spectral method for learning Markov models. Optim. Lett. 17(1): 143-162 (2023) - 2021
- [j18]Ting Tao, Shaohua Pan, Shujun Bi:
Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization. J. Glob. Optim. 81(4): 991-1017 (2021) - [j17]Yuqia Wu
Kurdyka-Łojasiewicz Property of Zero-Norm Composite Functions. J. Optim. Theory Appl. 188(1): 94-112 (2021) - [j16]Yuqia Wu, Shaohua Pan, Shujun Bi:
Correction to: Kurdyka-Łojasiewicz Property of Zero-Norm Composite Functions. J. Optim. Theory Appl. 190(1): 339-342 (2021) - 2020
- [j15]Shujun Bi, Shaohua Pan, Defeng Sun
A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery. Math. Program. Comput. 12(4): 569-602 (2020) - [j14]Yulan Liu, Shujun Bi, Shaohua Pan:
Several Classes of Stationary Points for Rank Regularized Minimization Problems. SIAM J. Optim. 30(2): 1756-1775 (2020)
2010 – 2019
- 2019
- [j13]Yulan Liu, Shujun Bi:
Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM. Appl. Math. Comput. 358: 418-435 (2019) - [j12]Ying Sun, Shaohua Pan, Shujun Bi:
Metric subregularity and/or calmness of the normal cone mapping to the p-order conic constraint system. Optim. Lett. 13(5): 1095-1110 (2019) - [i3]Shujun Bi, Ting Tao, Shaohua Pan:
KL property of exponent 1/2 of 𝓁2, 0-norm and DC regularized factorizations for low-rank matrix recovery. CoRR abs/1908.09078 (2019) - [i2]Ting Tao, Shaohua Pan, Shujun Bi:
Error bound of local minima and KL property of exponent 1/2 for squared F-norm regularized factorization. CoRR abs/1911.04293 (2019) - 2018
- [j11]Le Han, Shujun Bi:
Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss. J. Glob. Optim. 70(1): 71-97 (2018) - [j10]Yulan Liu, Shujun Bi, Shaohua Pan:
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems. J. Glob. Optim. 72(4): 679-704 (2018) - [i1]Yulan Liu, Shujun Bi, Shaohua Pan:
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems. CoRR abs/1804.11062 (2018) - 2017
- [j9]Shujun Bi, Shaohua Pan:
Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint. SIAM J. Control. Optim. 55(4): 2493-2518 (2017) - 2016
- [j8]Le Han, Shujun Bi, Shaohua Pan:
Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems. Comput. Optim. Appl. 64(1): 119-148 (2016) - [j7]Shujun Bi, Shaohua Pan:
Error bounds for rank constrained optimization problems and applications. Oper. Res. Lett. 44(3): 336-341 (2016) - 2014
- [j6]Shujun Bi, Xiaolan Liu, Shaohua Pan:
Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation. SIAM J. Sci. Comput. 36(4) (2014) - 2013
- [j5]Shujun Bi, Le Han, Shaohua Pan:
Approximation of rank function and its application to the nearest low-rank correlation matrix. J. Glob. Optim. 57(4): 1113-1137 (2013) - [j4]Le Han, Shujun Bi, Shaohua Pan:
Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming. Numer. Algorithms 62(1): 79-113 (2013) - 2012
- [j3]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
- [j2]Xin Guan, Huayang Wu, Shujun Bi:
A Game Theory-Based Obstacle Avoidance Routing Protocol for Wireless Sensor Networks. Sensors 11(10): 9327-9343 (2011) - [j1]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)
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-12-02 21:32 CET 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: