Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Jingben Yin"'
Publikováno v:
AIMS Mathematics, Vol 9, Iss 9, Pp 23837-23858 (2024)
This paper proposes an efficient method for acquiring the global solution of the sum of affine ratios problem (SARP) in the reduced outer space. Using equivalence conversions, the original problem was transformed into an equivalent problem. Then, an
Externí odkaz:
https://doaj.org/article/f6c72e0713b948348f85b3dd8fd25f52
Publikováno v:
AIMS Mathematics, Vol 8, Iss 1, Pp 1959-1974 (2023)
This paper proposes an outer space branching search method, which is used to globally solve the generalized affine fractional optimization problem (GAFOP). First, we will convert the GAFOP into an equivalent problem (EP). Next, we structure the linea
Externí odkaz:
https://doaj.org/article/4d4dbf09dd0241f68fa207990195ff18
Publikováno v:
IEEE Access, Vol 8, Pp 22072-22081 (2020)
We propose an $L_{p}$ -norm-based sparse regularization model for license plate deblurring, which is motivated by distinctive properties of license plate images. For the blurred images, general deblurring methods may restore a good overall visual eff
Externí odkaz:
https://doaj.org/article/2a28aa9c93784817a7e5355041ce4667
Publikováno v:
IEEE Access, Vol 8, Pp 80629-80637 (2020)
Base on the outer space search and the branch-and-bound framework, this paper presents an efficient outer space branch-and-bound algorithm for globally solving generalized linear multiplicative programming problem. First of all, we convert the proble
Externí odkaz:
https://doaj.org/article/08d92a88c07d473f98cc274d08f34e3a
Publikováno v:
IEEE Access, Vol 7, Pp 162245-162253 (2019)
In this paper, a new outer space rectangle branch and bound algorithm is proposed for globally solving generalized affine multiplicative programming problem. By applying the equivalent transformations and affine approximations of bilinear function, t
Externí odkaz:
https://doaj.org/article/55452a4bad18407985d72e192673a1e9
Publikováno v:
Complexity, Vol 2021 (2021)
This paper presents a rectangular branch-and-reduction algorithm for globally solving indefinite quadratic programming problem (IQPP), which has a wide application in engineering design and optimization. In this algorithm, first of all, we convert th
Externí odkaz:
https://doaj.org/article/5e83a53f35e24f4d8db4eb9c1f2f1376
Publikováno v:
Journal of Control Science and Engineering, Vol 2017 (2017)
This paper presents an out space branch-and-bound algorithm for solving generalized affine multiplicative programs problem. Firstly, by introducing new variables and constraints, we transform the original problem into an equivalent nonconvex programs
Externí odkaz:
https://doaj.org/article/7c9e173140c24f19a045d13640dfd089
Publikováno v:
Symmetry, Vol 11, Iss 3, p 424 (2019)
This paper will present an effective algorithm for globally solving quadratic programs with quadratic constraints. In this algorithm, we propose a new linearization method for establishing the linear programming relaxation problem of quadratic progra
Externí odkaz:
https://doaj.org/article/b78d8a63ca0345b5852c01303d2898fe
Publikováno v:
Mathematical Problems in Engineering, Vol 2021 (2021)
This paper presents an efficient outer space branch-and-bound algorithm for globally solving a minimax linear fractional programming problem (MLFP), which has a wide range of applications in data envelopment analysis, engineering optimization, manage
Publikováno v:
IEEE Access, Vol 8, Pp 80629-80637 (2020)
Base on the outer space search and the branch-and-bound framework, this paper presents an efficient outer space branch-and-bound algorithm for globally solving generalized linear multiplicative programming problem. First of all, we convert the proble