An Out Space Accelerating Algorithm for Generalized Affine Multiplicative Programs Problem
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 problem. Secondly, by utilizing new linear relaxa...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2017-01-01
|
Series: | Journal of Control Science and Engineering |
Online Access: | http://dx.doi.org/10.1155/2017/5249160 |
id |
doaj-7c9e173140c24f19a045d13640dfd089 |
---|---|
record_format |
Article |
spelling |
doaj-7c9e173140c24f19a045d13640dfd0892020-11-25T02:19:12ZengHindawi LimitedJournal of Control Science and Engineering1687-52491687-52572017-01-01201710.1155/2017/52491605249160An Out Space Accelerating Algorithm for Generalized Affine Multiplicative Programs ProblemLei Cai0Shuai Tang1Jingben Yin2Zhisong Hou3Hongwei Jiao4School of Information Engineering, Henan Institute of Science and Technology, Xinxiang 453003, ChinaJiyuan Vocational and Technical College, Jiyuan 459000, ChinaSchool of Mathematical Sciences, Henan Institute of Science and Technology, Xinxiang 453003, ChinaSchool of Information Engineering, Henan Institute of Science and Technology, Xinxiang 453003, ChinaSchool of Mathematical Sciences, Henan Institute of Science and Technology, Xinxiang 453003, ChinaThis 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 problem. Secondly, by utilizing new linear relaxation technique, we establish the linear relaxation programs problem of the equivalent problem. Thirdly, based on the out space partition and the linear relaxation programs problem, we construct an out space branch-and-bound algorithm. Fourthly, to improve the computational efficiency of the algorithm, an out space reduction operation is employed as an accelerating device for deleting a large part of the investigated out space region. Finally, the global convergence of the algorithm is proved, and numerical results demonstrate the feasibility and effectiveness of the proposed algorithm.http://dx.doi.org/10.1155/2017/5249160 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Lei Cai Shuai Tang Jingben Yin Zhisong Hou Hongwei Jiao |
spellingShingle |
Lei Cai Shuai Tang Jingben Yin Zhisong Hou Hongwei Jiao An Out Space Accelerating Algorithm for Generalized Affine Multiplicative Programs Problem Journal of Control Science and Engineering |
author_facet |
Lei Cai Shuai Tang Jingben Yin Zhisong Hou Hongwei Jiao |
author_sort |
Lei Cai |
title |
An Out Space Accelerating Algorithm for Generalized Affine Multiplicative Programs Problem |
title_short |
An Out Space Accelerating Algorithm for Generalized Affine Multiplicative Programs Problem |
title_full |
An Out Space Accelerating Algorithm for Generalized Affine Multiplicative Programs Problem |
title_fullStr |
An Out Space Accelerating Algorithm for Generalized Affine Multiplicative Programs Problem |
title_full_unstemmed |
An Out Space Accelerating Algorithm for Generalized Affine Multiplicative Programs Problem |
title_sort |
out space accelerating algorithm for generalized affine multiplicative programs problem |
publisher |
Hindawi Limited |
series |
Journal of Control Science and Engineering |
issn |
1687-5249 1687-5257 |
publishDate |
2017-01-01 |
description |
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 problem. Secondly, by utilizing new linear relaxation technique, we establish the linear relaxation programs problem of the equivalent problem. Thirdly, based on the out space partition and the linear relaxation programs problem, we construct an out space branch-and-bound algorithm. Fourthly, to improve the computational efficiency of the algorithm, an out space reduction operation is employed as an accelerating device for deleting a large part of the investigated out space region. Finally, the global convergence of the algorithm is proved, and numerical results demonstrate the feasibility and effectiveness of the proposed algorithm. |
url |
http://dx.doi.org/10.1155/2017/5249160 |
work_keys_str_mv |
AT leicai anoutspaceacceleratingalgorithmforgeneralizedaffinemultiplicativeprogramsproblem AT shuaitang anoutspaceacceleratingalgorithmforgeneralizedaffinemultiplicativeprogramsproblem AT jingbenyin anoutspaceacceleratingalgorithmforgeneralizedaffinemultiplicativeprogramsproblem AT zhisonghou anoutspaceacceleratingalgorithmforgeneralizedaffinemultiplicativeprogramsproblem AT hongweijiao anoutspaceacceleratingalgorithmforgeneralizedaffinemultiplicativeprogramsproblem AT leicai outspaceacceleratingalgorithmforgeneralizedaffinemultiplicativeprogramsproblem AT shuaitang outspaceacceleratingalgorithmforgeneralizedaffinemultiplicativeprogramsproblem AT jingbenyin outspaceacceleratingalgorithmforgeneralizedaffinemultiplicativeprogramsproblem AT zhisonghou outspaceacceleratingalgorithmforgeneralizedaffinemultiplicativeprogramsproblem AT hongweijiao outspaceacceleratingalgorithmforgeneralizedaffinemultiplicativeprogramsproblem |
_version_ |
1724877736722300928 |