Yun-Bin Zhao

Orcid: 0000-0002-2388-9047

Affiliations:
  • University of Birmingham, UK
  • Chinese Academy of Sciences, Beijing, China


According to our database1, Yun-Bin Zhao authored at least 41 papers between 1999 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Painlevé-Kuratowski convergence of minimal solutions for set-valued optimization problems via improvement sets.
J. Glob. Optim., November, 2023

Heavy-Ball-Based Optimal Thresholding Algorithms for Sparse Linear Inverse Problems.
J. Sci. Comput., September, 2023

Heavy-ball-based hard thresholding algorithms for sparse signal recovery.
J. Comput. Appl. Math., 2023

2022
Partial gradient optimal thresholding algorithms for a class of sparse optimization problems.
J. Glob. Optim., 2022

Natural Thresholding Algorithms for Signal Recovery with Sparsity.
CoRR, 2022

2021
Analysis of optimal thresholding algorithms for compressed sensing.
Signal Process., 2021

Dual-density-based reweighted ℓ <sub>1</sub>-algorithms for a class of ℓ <sub>0</sub>-minimization problems.
J. Glob. Optim., 2021

Dynamic Orthogonal Matching Pursuit for Signal Reconstruction.
CoRR, 2021

2020
Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery.
IEEE Trans. Signal Process., 2020

Optimal k-Thresholding Algorithms for Sparse Optimization Problems.
SIAM J. Optim., 2020

Stability analysis of a class of sparse optimization problems.
Optim. Methods Softw., 2020

2019
Weak Stability of <i>ℓ</i><sub>1</sub>-Minimization Methods in Sparse Data Reconstruction.
Math. Oper. Res., 2019

2017
Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets.
Math. Oper. Res., 2017

Weak Stability of ࡁ<sub>1</sub>-minimization Methods in Sparse Data Reconstruction.
CoRR, 2017

2015
A New Computational Method for the Sparsest Solutions to Systems of Linear Equations.
SIAM J. Optim., 2015

On the proximal Landweber Newton method for a class of nonsmooth convex problems.
Comput. Optim. Appl., 2015

Uniqueness Conditions for A Class of ℓ<sub>0</sub>-Minimization Problems.
Asia Pac. J. Oper. Res., 2015

2014
1-Bit Compressive Sensing: Reformulation and RRSP-Based Recovery Theory.
CoRR, 2014

2013
RSP-Based Analysis for Sparsest and Least ℓ<sub>1</sub>-Norm Solutions to Underdetermined Linear Systems.
IEEE Trans. Signal Process., 2013

Uniqueness Conditions for A Class of l0-Minimization Problems.
CoRR, 2013

Rank-one solutions for homogeneous linear matrix equations over the positive semidefinite cone.
Appl. Math. Comput., 2013

New and improved conditions for uniqueness of sparsest solutions of underdetermined linear systems.
Appl. Math. Comput., 2013

2012
Reweighted <sub>1</sub>-Minimization for Sparse Solutions to Underdetermined Linear Systems.
SIAM J. Optim., 2012

2011
Robust univariate spline models for interpolating interval data.
Oper. Res. Lett., 2011

Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities.
J. Comput. Appl. Math., 2011

2010
The Legendre-Fenchel Conjugate of the Product of Two Positive Definite Quadratic Forms.
SIAM J. Matrix Anal. Appl., 2010

2009
Relaxed robust second-order-cone programming.
Appl. Math. Comput., 2009

2008
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets.
SIAM J. Optim., 2008

Geometric dual formulation for first-derivative-based univariate cubic <i>L</i> <sub>1</sub> splines.
J. Glob. Optim., 2008

2007
Global bounds for the distance to solutions of co-coercive variational inequalities.
Oper. Res. Lett., 2007

2006
Constructing Generalized Mean Functions Using Convex Functions with Regularity Conditions.
SIAM J. Optim., 2006

A New Path-Following Algorithm for Nonlinear P*Complementarity Problems.
Comput. Optim. Appl., 2006

2004
Properties of a homotopy solution path for complementarity problems with quasi-monotone mappings.
Appl. Math. Comput., 2004

2003
A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P[sub 0] LCPs.
SIAM J. Optim., 2003

2002
Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method.
SIAM J. Optim., 2002

2001
Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application.
SIAM J. Optim., 2001

Existence and Limiting Behavior of a Non--Interior-Point Trajectory for Nonlinear Complementarity Problems Without Strict Feasibility Condition.
SIAM J. Control. Optim., 2001

On a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems.
Math. Oper. Res., 2001

2000
Properties of a Multivalued Mapping Associated with Some Nonmonotone Complementarity Problems.
SIAM J. Control. Optim., 2000

An alternative theorem for generalized variational inequalities and solvability of nonlinear quasi-P<sup>M</sup><sub>*</sub>-complementarity problems.
Appl. Math. Comput., 2000

1999
D-orientation sequences for continuous functions and nonlinear complementarity problems.
Appl. Math. Comput., 1999


  Loading...