Biao QU

Prof. Biao QU


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 March 2009 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
Louis CaccettaLouis Caccetta
Louis Caccetta
BQBiao QU
Biao QU
GZGuanglu Zhou
Guanglu Zhou

31 July 2014 in Numerical Functional Analysis and Optimization
Verified
Journal Article
Closed access
BLBinghua Liu
Binghua Liu
BQBiao QU
Biao QU
NZNa Zheng
Na Zheng

10 November 2016 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
BQBiao QU
Biao QU
CWChangyu Wang
Changyu Wang
NXNaihua Xiu
Naihua Xiu

1 January 2013 in Journal of Applied Mathematics
Verified
Journal Article
Open access
PDF file
BQBiao QU
Biao QU
JZJing Zhao
Jing Zhao
The generalized Nash equilibrium problem (GNEP) is an extension of the standard Nash equilibrium problem (NEP), in which each player's strategy set may depend on the rival player's strategies. In this paper, we present two descent type methods. The algorithms are based on a reformulation of the generalized Nash equilibrium using Nikaido-Isoda function as unconstrained optimization. We prove that our algorithms are globally convergent and the convergence analysis is not based on conditions guaranteeing that every stationary point of the optimization problem is a solution of the GNEP.

22 August 2017 in Numerical Functional Analysis and Optimization
Verified
Journal Article
Closed access
BQBiao QU
Biao QU
HCHanxiao Chang
Hanxiao Chang
Recently, assuming that the metric projection onto a closed convex set is easily calculated, Liu et al. (Numer. Func. Anal. Opt. 35:1459–1466, 2014) presented a successive projection algorithm for solving the multiple-sets split feasibility problem (MSFP). However, in some cases it is impossible or needs too much work to exactly compute the metric projection. The aim of this remark is to give a modification to the successive projection algorithm. That is, we propose a relaxed successive projection algorithm, in which the metric projections onto closed convex sets are replaced by the metric projections onto halfspaces. Clearly, the metric projection onto a halfspace may be directly calculated. So, the relaxed successive projection algorithm is easy to implement. Its theoretical convergence results are also given.

5 February 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
JSJun Sun
Jun Sun
LKLingchen Kong
Lingchen Kong
BQBiao QU
Biao QU
In the past decade, the scientific community has become increasingly interested in the re-identification of people. It is still a challenging problem due to its low-quality images; occlusion between objects; and huge changes in lighting, viewpoint and posture (even for the same person). Therefore, we propose a dictionary learning method that divides the appearance characteristics of pedestrians into a shared part, which comprises the similarity between different pedestrians, and a specific part, which reflects unique identity information. In the process of re-identification, by removing the shared part of a pedestrian’s visual characteristics and considering the unique part of each person, the ambiguity of the pedestrian’s visual characteristics can be reduced. In addition, considering the structural characteristics of the shared dictionary and special dictionary, low-rank, l0 norm and row sparsity constraints instead of their convex-relaxed forms are introduced into the dictionary learning framework to improve its representation and recognition capabilities. Therefore, we adopt the method of alternating directions to solve it. The experimental results of several commonly used datasets show the effectiveness of our proposed method.