{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:43:00Z","timestamp":1763642580656,"version":"build-2065373602"},"reference-count":47,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:00:00Z","timestamp":1553212800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Science and Technology Project of Henan Province","award":["182102310941"],"award-info":[{"award-number":["182102310941"]}]},{"name":"the Key Scienti\ufb01c Research Project of Universities of Henan Province","award":["17A110021, 16A110013, 16A110014"],"award-info":[{"award-number":["17A110021, 16A110013, 16A110014"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>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 programs with quadratic constraints. The proposed algorithm converges with the global optimal solution of the initial problem, and numerical experiments show the computational efficiency of the proposed algorithm.<\/jats:p>","DOI":"10.3390\/sym11030424","type":"journal-article","created":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T06:56:52Z","timestamp":1553497012000},"page":"424","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Effective Global Optimization Algorithm for Quadratic Programs with Quadratic Constraints"],"prefix":"10.3390","volume":"11","author":[{"given":"Dongwei","family":"Shi","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Henan Institute of Science and Technology, Xinxiang 453003, China"}]},{"given":"Jingben","family":"Yin","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Henan Institute of Science and Technology, Xinxiang 453003, China"}]},{"given":"Chunyang","family":"Bai","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Henan Institute of Science and Technology, Xinxiang 453003, China"}]}],"member":"1968","published-online":{"date-parts":[[2019,3,22]]},"reference":[{"key":"ref_1","first-page":"504","article-title":"Dynamic task assignment and path planning of multi-auv system based on an improved self-organizing map and velocity synthesis method in three-dimensional underwater workspace","volume":"43","author":"Zhu","year":"2012","journal-title":"IEEE Trans. Cybern."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s40314-015-0224-5","article-title":"Range division and compression algorithm for quadratically constrained sum of quadratic ratios","volume":"36","author":"Jiao","year":"2017","journal-title":"Comput. Appl. Math."},{"key":"ref_3","first-page":"1","article-title":"Multi-auv cooperative target search algorithm in 3-D underwater workspace","volume":"53","author":"Cao","year":"2017","journal-title":"J. Navig."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1080\/10798587.2015.1118277","article-title":"Multi-AUV task assignment and path planning with ocean current based on biological inspired self-organizing map and velocity synthesis algorithm","volume":"23","author":"Cao","year":"2017","journal-title":"Intell. Autom. Soft Comput."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Wieczorek, \u0141., and Ignaciuk, P. (2018). Continuous Genetic Algorithms as Intelligent Assistance for Resource Distribution in Logistic Systems. Data, 3.","DOI":"10.3390\/data3040068"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Salami, M., Movahedi Sobhani, F., and Ghazizadeh, M. (2018). Short-Term Forecasting of Electricity Supply and Demand by Using the Wavelet-PSO-NNs-SO Technique for Searching in Big Data of Iran\u2019s Electricity Market. Data, 3.","DOI":"10.3390\/data3040043"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Faris, H. (2018). A Hybrid Swarm Intelligent Neural Network Model for Customer Churn Prediction and Identifying the Influencing Factors. Information, 9.","DOI":"10.3390\/info9110288"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Stoj\u010di\u0107, M., Pamu\u010dar, D., Mahmutagi\u0107, E., and Stevi\u0107, \u017d. (2018). Development of an ANFIS Model for the Optimization of a Queuing System in Warehouses. Information, 9.","DOI":"10.3390\/info9100240"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Lee, P., and Kang, S. (2018). An Interactive Multiobjective Optimization Approach to Supplier Selection and Order Allocation Problems Using the Concept of Desirability. Information, 9.","DOI":"10.3390\/info9060130"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1504\/IJDATS.2018.092444","article-title":"Particle swarm optimised fuzzy method for prediction of water table elevation fluctuation","volume":"10","author":"Jain","year":"2018","journal-title":"Int. J. Data Anal. Tech. Strateg."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1504\/IJDATS.2018.094129","article-title":"Using improved genetic algorithm under uncertain circumstance of site selection of O2O customer returns","volume":"10","author":"Sun","year":"2018","journal-title":"Int. J. Data Anal. Tech. Strateg."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Shen, P., Zhang, T., and Wang, C. (2017). Solving a class of generalized fractional programming problems using the feasibility of linear programs. J. Inequal. Appl., 147.","DOI":"10.1186\/s13660-017-1420-1"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1426","DOI":"10.1080\/01630563.2017.1327869","article-title":"An efficient algorithm for quadratic sum-of-ratios fractional programs problem","volume":"38","author":"Jiao","year":"2017","journal-title":"Numer. Funct. Anal. Optim."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1023\/A:1009739827008","article-title":"Approximation algorithms for quadratic programming","volume":"2","author":"Fu","year":"1998","journal-title":"J. Comb. Optim."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Shen, P., and Wang, C. (2017). Linear decomposition approach for a class of nonconvex programming problems. J. Inequal. Appl., 74.","DOI":"10.1186\/s13660-017-1342-y"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1515\/math-2017-0099","article-title":"Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs","volume":"15","author":"Hou","year":"2017","journal-title":"Open Math."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"698489","DOI":"10.1155\/2014\/698489","article-title":"A Novel Optimization Method for Nonconvex Quadratically Constrained Quadratic Programs","volume":"2014","author":"Jiao","year":"2014","journal-title":"Abstr. Appl. Anal."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.cam.2016.12.037","article-title":"Global optimization algorithm for mixed integer quadratically constrained quadratic program","volume":"319","author":"Zhao","year":"2017","journal-title":"J. Comput. Appl. Math."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Jiao, H., and Chen, R. (2018). A parametric linearizing approach for quadratically inequality constrained quadratic programs. Open Math.","DOI":"10.1515\/math-2018-0037"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/j.cam.2018.10.038","article-title":"Range division and linearization algorithm for a class of linear ratios optimization problems","volume":"350","author":"Shen","year":"2019","journal-title":"J. Comput. Appl. Math."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.cam.2007.01.039","article-title":"Accelerating method of global optimization for signomial geometric programming","volume":"214","author":"Shen","year":"2008","journal-title":"J. Comput. Appl. Math."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Shen, P., and Huang, B. (2019). Global algorithm for solving linear multiplicative programming problems. Optim. Lett.","DOI":"10.1007\/s11590-018-1378-z"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.apm.2012.02.023","article-title":"Global optimization algorithm for sum of generalized polynomial ratios problem","volume":"37","author":"Jiao","year":"2013","journal-title":"Appl. Math. Model."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2573","DOI":"10.1016\/j.cor.2008.11.002","article-title":"A nonisolated optimal solution of general linear multiplicative programming problems","volume":"36","author":"Chen","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Shen, P.-P., and Lu, T. (2018). Regional division and reduction algorithm for minimizing the sum of linear fractional functions. J. Inequal. Appl., 63.","DOI":"10.1186\/s13660-018-1651-9"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1007\/s10898-012-9933-0","article-title":"Branch reduction bound algorithm for generalized geometric programming","volume":"56","author":"Shen","year":"2013","journal-title":"J. Glob. Optim."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1873","DOI":"10.1186\/s40064-016-3516-3","article-title":"Optimality condition and iterative thresholding algorithm for l(p)-regularization problems","volume":"5","author":"Jiao","year":"2016","journal-title":"SpringerPlus"},{"key":"ref_28","first-page":"116","article-title":"Range division and contraction algorithm for a class of global optimization problems","volume":"242","author":"Shen","year":"2014","journal-title":"J. Glob. Optim."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1186\/s40064-016-2984-9","article-title":"An efficient method for generalized linear multiplicative programming problem with multiplicative constraints","volume":"5","author":"Zhao","year":"2016","journal-title":"SpringerPlus"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"7568","DOI":"10.1016\/j.apm.2015.03.025","article-title":"Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints","volume":"39","author":"Jiao","year":"2015","journal-title":"Appl. Math. Model."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1080\/02331934.2011.604871","article-title":"Global optimization for generalized geometric programming problems with discrete variables","volume":"62","author":"Shen","year":"2013","journal-title":"Optimization"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1016\/j.na.2008.02.005","article-title":"A branch and bound algorithm for globally solving a class of nonconvex programming problems","volume":"70","author":"Jiao","year":"2009","journal-title":"Nonlinear Anal. Theory Methods Appl."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1730","DOI":"10.1080\/00207160.2013.860449","article-title":"A new linearization technique for minimax linear fractional programming","volume":"91","author":"Jiao","year":"2014","journal-title":"Int. J. Comput. Math."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/j.amc.2006.05.102","article-title":"Global optimization of generalized linear fractional programming with nonlinear constraints","volume":"183","author":"Jiao","year":"2006","journal-title":"Appl. Math. Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1515\/math-2016-0058","article-title":"Outcome space range reduction method for global optimization of sum of affine ratios problem","volume":"14","author":"Jiao","year":"2016","journal-title":"Open Math."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.ejor.2015.01.039","article-title":"A practicable branch and bound algorithm for sum of linear ratios problem","volume":"243","author":"Jiao","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1016\/j.amc.2014.11.032","article-title":"A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming","volume":"250","author":"Jiao","year":"2015","journal-title":"Appl. Math. Comput."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/j.amc.2006.05.074","article-title":"Linearization method for a class of multiplicative programming with exponent","volume":"183","author":"Shen","year":"2006","journal-title":"Appl. Math. Comput."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Horst, R., and Tuy, H. (1993). Global Optimization: Deterministic Approaches, Springer. [2nd ed.].","DOI":"10.1007\/978-3-662-02947-3"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1016\/j.amc.2006.05.137","article-title":"A new rectangle branch-and-pruning appproach for generalized geometric programming","volume":"183","author":"Shen","year":"2006","journal-title":"Appl. Math. Comput."},{"key":"ref_41","first-page":"923","article-title":"A global optimization approach for quadratic programs with nonconvex quadratic constraints","volume":"25","author":"Shen","year":"2008","journal-title":"Chin. J. Eng. Math."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.amc.2005.01.142","article-title":"A deterministic global optimization algorithm for generalized geometric programming","volume":"168","author":"Wang","year":"2005","journal-title":"Appl. Math. Comput."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"215312","DOI":"10.1155\/2013\/215312","article-title":"A global optimization algorithm for generalized quadratic programming","volume":"2013","author":"Jiao","year":"2013","journal-title":"J. Appl. Math."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1016\/j.camwa.2004.07.008","article-title":"Global optimization of generalized geometric programming","volume":"48","author":"Wang","year":"2004","journal-title":"Comput. Math. Appl."},{"key":"ref_45","first-page":"9","article-title":"A branch and reduce approach for solving nonconvex quadratic programming problems with quadratic constraints","volume":"9","author":"Gao","year":"2005","journal-title":"OR Trans."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.amc.2003.12.101","article-title":"Linearization method of global optimization for generalized geometric programming","volume":"162","author":"Shen","year":"2005","journal-title":"Appl. Math. Comput."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1016\/j.mcm.2008.04.004","article-title":"A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs","volume":"48","author":"Qu","year":"2008","journal-title":"Math. Comput. Model."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/3\/424\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:39:57Z","timestamp":1760186397000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/3\/424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,22]]},"references-count":47,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,3]]}},"alternative-id":["sym11030424"],"URL":"https:\/\/doi.org\/10.3390\/sym11030424","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2019,3,22]]}}}