Shujun Bi

Orcid: 0000-0003-2950-8150

According to our database1, Shujun Bi authored at least 24 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Sparse Signal Reconstruction: Sequential Convex Relaxation, Restricted Null Space Property, and Error Bounds.
IEEE Trans. Inf. Theory, November, 2024

2023
Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound.
Comput. Optim. Appl., November, 2023

A matrix nonconvex relaxation approach to unconstrained binary polynomial programs.
Comput. Optim. Appl., April, 2023

A low-rank spectral method for learning Markov models.
Optim. Lett., 2023

2021
Correction to: Kurdyka-Łojasiewicz Property of Zero-Norm Composite Functions.
J. Optim. Theory Appl., 2021

Kurdyka-Łojasiewicz Property of Zero-Norm Composite Functions.
J. Optim. Theory Appl., 2021

Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization.
J. Glob. Optim., 2021

2020
Several Classes of Stationary Points for Rank Regularized Minimization Problems.
SIAM J. Optim., 2020

A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery.
Math. Program. Comput., 2020

2019
Metric subregularity and/or calmness of the normal cone mapping to the p-order conic constraint system.
Optim. Lett., 2019

Error bound of local minima and KL property of exponent 1/2 for squared F-norm regularized factorization.
CoRR, 2019

KL property of exponent 1/2 of 𝓁<sub>2, 0</sub>-norm and DC regularized factorizations for low-rank matrix recovery.
CoRR, 2019

Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM.
Appl. Math. Comput., 2019

2018
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems.
J. Glob. Optim., 2018

Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss.
J. Glob. Optim., 2018

2017
Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint.
SIAM J. Control. Optim., 2017

2016
Error bounds for rank constrained optimization problems and applications.
Oper. Res. Lett., 2016

Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems.
Comput. Optim. Appl., 2016

2014
Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation.
SIAM J. Sci. Comput., 2014

2013
Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming.
Numer. Algorithms, 2013

Approximation of rank function and its application to the nearest low-rank correlation matrix.
J. Glob. Optim., 2013

2012
The same growth of FB and NR symmetric cone complementarity functions.
Optim. Lett., 2012

2011
Nonsingularity Conditions for the Fischer-Burmeister System of Nonlinear SDPs.
SIAM J. Optim., 2011

A Game Theory-Based Obstacle Avoidance Routing Protocol for Wireless Sensor Networks.
Sensors, 2011


  Loading...