{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T09:17:13Z","timestamp":1762161433036,"version":"3.37.3"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T00:00:00Z","timestamp":1532390400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10898-018-0692-4","type":"journal-article","created":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T17:32:37Z","timestamp":1532453557000},"page":"193-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint"],"prefix":"10.1007","volume":"73","author":[{"given":"Baohua","family":"Huang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5936-789X","authenticated-orcid":false,"given":"Changfeng","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"key":"692_CR1","doi-asserted-by":"publisher","first-page":"1546","DOI":"10.1080\/00207160.2012.761337","volume":"90","author":"FPA Beik","year":"2013","unstructured":"Beik, F.P.A., Salkuyeh, D.K.: The coupled Sylvester-transpose matrix equations over generalized centro-symmetric matrices. Int. J. Comput. Math. 90, 1546\u20131566 (2013)","journal-title":"Int. J. Comput. Math."},{"key":"692_CR2","first-page":"1","volume":"45","author":"A Bjerhammer","year":"1951","unstructured":"Bjerhammer, A.: Rectangular reciprocal matrices with special reference to geodetic calculations. Kung. Tekn. Hogsk. Handl. Stockh. 45, 1\u201386 (1951)","journal-title":"Kung. Tekn. Hogsk. Handl. Stockh."},{"key":"692_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1080\/00207179608921833","volume":"63","author":"J Chen","year":"1996","unstructured":"Chen, J., Patton, R., Zhang, H.: Design unknown input observers and robust fault detection filter. Int. J. Control 63, 85\u2013105 (1996)","journal-title":"Int. J. Control"},{"key":"692_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0024-3795(90)90370-R","volume":"131","author":"H Dai","year":"1990","unstructured":"Dai, H.: On the symmetric solutions of linear matrix equations. Linear Algebra Appl. 131, 1\u20137 (1990)","journal-title":"Linear Algebra Appl."},{"key":"692_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0002475","volume-title":"Singular Control Systems","author":"L Dai","year":"1989","unstructured":"Dai, L.: Singular Control Systems. Springer, Berlin (1989)"},{"key":"692_CR6","first-page":"571","volume":"202","author":"M Dehghan","year":"2008","unstructured":"Dehghan, M., Hajarian, M.: An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation. Appl. Math. Comput. 202, 571\u2013588 (2008)","journal-title":"Appl. Math. Comput."},{"key":"692_CR7","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1016\/j.laa.2009.11.014","volume":"432","author":"M Dehghan","year":"2010","unstructured":"Dehghan, M., Hajarian, M.: The general coupled matrix equations over generalized bisymmetric matrices. Linear Algebra Appl. 432, 1531\u20131552 (2010)","journal-title":"Linear Algebra Appl."},{"key":"692_CR8","doi-asserted-by":"publisher","first-page":"1580","DOI":"10.1080\/00207721.2010.549584","volume":"43","author":"M Dehghan","year":"2012","unstructured":"Dehghan, M., Hajarian, M.: The generalized Sylvester matrix equations over the generalized bisymmetric and skew-symmetric matrices. Int. J. Syst. Sci. 43, 1580\u20131590 (2012)","journal-title":"Int. J. Syst. Sci."},{"key":"692_CR9","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1080\/03081087.2010.524363","volume":"59","author":"M Dehghan","year":"2011","unstructured":"Dehghan, M., Hajarian, M.: On the generalized bisymmetric and skew-symmetric solutions of the system of generalized Sylvester matrix equations. Linear Multilinear Algebra 59, 1281\u20131309 (2011)","journal-title":"Linear Multilinear Algebra"},{"key":"692_CR10","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1177\/0142331212465105","volume":"35","author":"M Dehghan","year":"2013","unstructured":"Dehghan, M., Hajarian, M.: Construction of an iterative method for solving generalized coupled Sylvester matrix equations. Trans. Inst. Meas. Control 35, 961\u2013970 (2013)","journal-title":"Trans. Inst. Meas. Control"},{"key":"692_CR11","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.apm.2009.06.018","volume":"34","author":"M Dehghan","year":"2010","unstructured":"Dehghan, M., Hajarian, M.: An iterative method for solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices. Appl. Math. Modell. 34, 639\u2013654 (2010)","journal-title":"Appl. Math. Modell."},{"key":"692_CR12","first-page":"950","volume":"243","author":"AJ Liu","year":"2014","unstructured":"Liu, A.J., Chen, G.L.: On the Hermitian positive definite solutions of nonlinear matrix equation \n                    \n                      \n                    \n                    $$X^s+\\sum \\limits _{i=1}^{m}A_i^*X^{-t_i}A_i=Q$$\n                    \n                      \n                        \n                          \n                            X\n                            s\n                          \n                          +\n                          \n                            \u2211\n                            \n                              i\n                              =\n                              1\n                            \n                            m\n                          \n                          \n                            A\n                            i\n                            \u2217\n                          \n                          \n                            X\n                            \n                              -\n                              \n                                t\n                                i\n                              \n                            \n                          \n                          \n                            A\n                            i\n                          \n                          =\n                          Q\n                        \n                      \n                    \n                  . Appl. Math. Comput. 243, 950\u2013959 (2014)","journal-title":"Appl. Math. Comput."},{"key":"692_CR13","doi-asserted-by":"crossref","unstructured":"Liu, A.J., Chen, G.L., Zhang, X.Y.: A new method for the bisymmetric minimum norm solution of the consistent matrix equations \n                    \n                      \n                    \n                    $$A_1XB_1=C_1, A_2XB_2=C_2$$\n                    \n                      \n                        \n                          \n                            A\n                            1\n                          \n                          X\n                          \n                            B\n                            1\n                          \n                          =\n                          \n                            C\n                            1\n                          \n                          ,\n                          \n                            A\n                            2\n                          \n                          X\n                          \n                            B\n                            2\n                          \n                          =\n                          \n                            C\n                            2\n                          \n                        \n                      \n                    \n                  , J. Appl. Math., Vol. 2013, Article ID 125687, 6 pages","DOI":"10.1155\/2013\/125687"},{"key":"692_CR14","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1002\/mma.1459","volume":"34","author":"M Dehghan","year":"2011","unstructured":"Dehghan, M., Hajarian, M.: The generalized centro-symmetric and least squares generalized centro-symmetric solutions of the matrix equation \n                    \n                      \n                    \n                    $$AYB + CY^TD = E$$\n                    \n                      \n                        \n                          A\n                          Y\n                          B\n                          +\n                          C\n                          \n                            Y\n                            T\n                          \n                          D\n                          =\n                          E\n                        \n                      \n                    \n                  . Math. Methods Appl. Sci. 34, 1562\u20131579 (2011)","journal-title":"Math. Methods Appl. Sci."},{"key":"692_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.sysconle.2004.06.008","volume":"54","author":"F Ding","year":"2005","unstructured":"Ding, F., Chen, T.: Iterative least squares solutions of coupled Sylvester matrix equations. Systems Control Lett. 54, 95\u2013107 (2005)","journal-title":"Systems Control Lett."},{"key":"692_CR16","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1049\/iet-cta.2013.1044","volume":"8","author":"F Ding","year":"2014","unstructured":"Ding, F., Zhang, H.M.: Gradient-based iterative algorithm for a class of the coupled matrix equations related to control systems. IET Control Theory Appl. 8, 1588\u20131595 (2014)","journal-title":"IET Control Theory Appl."},{"key":"692_CR17","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/S0005-1098(01)00251-5","volume":"38","author":"GR Duan","year":"2002","unstructured":"Duan, G.R., Liu, G.P.: Complete parametric approach for eigenstrutture assignment in a class of second order linear systems. Automatica 38, 725\u2013729 (2002)","journal-title":"Automatica"},{"key":"692_CR18","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1016\/j.aml.2003.05.012","volume":"17","author":"GR Duan","year":"2004","unstructured":"Duan, G.R.: The solution to the matrix equation \n                    \n                      \n                    \n                    $$AV + BW = EVJ + R$$\n                    \n                      \n                        \n                          A\n                          V\n                          +\n                          B\n                          W\n                          =\n                          E\n                          V\n                          J\n                          +\n                          R\n                        \n                      \n                    \n                  . Appl. Math. Lett. 17, 1197\u20131202 (2004)","journal-title":"Appl. Math. Lett."},{"key":"692_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0024-3795(89)90067-0","volume":"119","author":"KW Eric Chu","year":"1989","unstructured":"Eric Chu, K.W.: Symmetric solutions of linear matrix equations by matrix decompositions. Linear Algebra Appl. 119, 35\u201350 (1989)","journal-title":"Linear Algebra Appl."},{"key":"692_CR20","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1109\/TAC.1986.1104189","volume":"31","author":"LR Fletcher","year":"1986","unstructured":"Fletcher, L.R., Kuatsky, J., Nichols, N.K.: Eigenstructure assignment in descriptor systems. IEEE Trans. Autom. Control 31, 1138\u20131141 (1986)","journal-title":"IEEE Trans. Autom. Control"},{"key":"692_CR21","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/0005-1098(90)90018-D","volume":"26","author":"PM Frank","year":"1990","unstructured":"Frank, P.M.: Fault diagnosis in dynamic systems using analytical and knowledge-based redundancy\u2014a survey and some new results. Automatica 26, 459\u2013474 (1990)","journal-title":"Automatica"},{"key":"692_CR22","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"NIM Gould","year":"1999","unstructured":"Gould, N.I.M., Lucidi, S., Roma, M., Toint, P.L.: Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9, 504\u2013525 (1999)","journal-title":"SIAM J. Optim."},{"key":"692_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.aml.2015.08.017","volume":"52","author":"M Hajarian","year":"2016","unstructured":"Hajarian, M.: Solving the general Sylvester discrete-time periodic matrix equations via the gradient based iterative method. Appl. Math. Lett. 52, 87\u201395 (2016)","journal-title":"Appl. Math. Lett."},{"key":"692_CR24","doi-asserted-by":"publisher","first-page":"533","DOI":"10.3846\/13926292.2016.1186119","volume":"21","author":"M Hajarian","year":"2016","unstructured":"Hajarian, M.: Gradient based iterative algorithm to solve general coupled discrete-time periodic matrix equations over generalized reflexive matrices. Math. Model. Anal. 21, 533\u2013549 (2016)","journal-title":"Math. Model. Anal."},{"key":"692_CR25","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1016\/j.jfranklin.2015.05.024","volume":"353","author":"M Hajarian","year":"2016","unstructured":"Hajarian, M.: Extending the CGLS algorithm for least squares solutions of the generalized Sylvester-transpose matrix equations. J. Frankl. I 353, 1168\u20131185 (2016)","journal-title":"J. Frankl. I"},{"key":"692_CR26","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/asjc.1343","volume":"19","author":"M Hajarian","year":"2017","unstructured":"Hajarian, M.: New finite algorithm for solving the generalized nonhomogeneous Yakubovich-transpose matrix equation. Asian J. Control 19, 164\u2013172 (2017)","journal-title":"Asian J. Control"},{"key":"692_CR27","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s11075-016-0109-8","volume":"73","author":"M Hajarian","year":"2016","unstructured":"Hajarian, M.: Generalized conjugate direction algorithm for solving the general coupled matrix equations over symmetric matrices. Numer. Algorithms 73, 591\u2013609 (2016)","journal-title":"Numer. Algorithms"},{"key":"692_CR28","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10957-015-0737-5","volume":"170","author":"M Hajarian","year":"2016","unstructured":"Hajarian, M.: Least squares solution of the linear operator equation. J. Optim. Theory Appl. 170, 205\u2013219 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"692_CR29","doi-asserted-by":"publisher","first-page":"3328","DOI":"10.1016\/j.jfranklin.2013.07.008","volume":"350","author":"M Hajarian","year":"2013","unstructured":"Hajarian, M.: Matrix iterative methods for solving the Sylvester-transpose and periodic Sylvester matrix equations. J. Frankl. I 350, 3328\u20133341 (2013)","journal-title":"J. Frankl. I"},{"key":"692_CR30","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.aml.2014.03.013","volume":"34","author":"M Hajarian","year":"2014","unstructured":"Hajarian, M.: Matrix form of the CGS method for solving general coupled matrix equations. Appl. Math. Lett. 34, 37\u201342 (2014)","journal-title":"Appl. Math. Lett."},{"key":"692_CR31","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s11633-014-0762-0","volume":"11","author":"M Hajarian","year":"2014","unstructured":"Hajarian, M.: Developing BiCG and BiCR methods to solve generalized Sylvester-transpose matrix equations. Int. J. Autom. Comput. 11, 25\u201329 (2014)","journal-title":"Int. J. Autom. Comput."},{"key":"692_CR32","doi-asserted-by":"publisher","first-page":"6073","DOI":"10.1016\/j.apm.2015.01.026","volume":"39","author":"M Hajarian","year":"2015","unstructured":"Hajarian, M.: Developing BiCOR and CORS methods for coupled Sylvester-transpose and periodic Sylvester matrix equations. Appl. Math. Modell. 39, 6073\u20136084 (2015)","journal-title":"Appl. Math. Modell."},{"key":"692_CR33","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1049\/iet-cta.2014.0669","volume":"9","author":"M Hajarian","year":"2015","unstructured":"Hajarian, M.: Matrix GPBiCG algorithms for solving the general coupled matrix equations. IET Control Theory Appl. 9, 74\u201381 (2015)","journal-title":"IET Control Theory Appl."},{"key":"692_CR34","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1016\/j.aml.2013.05.009","volume":"26","author":"M Hajarian","year":"2013","unstructured":"Hajarian, M.: The generalized QMRCGSTAB algorithm for solving Sylvester-transpose matrix equations. Appl. Math. Lett. 26, 1013\u20131017 (2013)","journal-title":"Appl. Math. Lett."},{"key":"692_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0024-3795(87)90308-9","volume":"93","author":"FJ Henk Don","year":"1988","unstructured":"Henk Don, F.J.: On the symmetric solution of a linear matrix equation. Linear Algebra Appl. 93, 1\u20137 (1988)","journal-title":"Linear Algebra Appl."},{"key":"692_CR36","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stds. 49, 409\u2013436 (1952)","journal-title":"J. Res. Nat. Bur. Stds."},{"key":"692_CR37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371","volume-title":"Topics in Matrix Analysis","author":"RA Horn","year":"1991","unstructured":"Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, New York (1991)"},{"key":"692_CR38","doi-asserted-by":"publisher","first-page":"6381","DOI":"10.1016\/j.jfranklin.2017.08.004","volume":"354","author":"BH Huang","year":"2017","unstructured":"Huang, B.H., Ma, C.F.: Symmetric least squares solution of a class of Sylvester matrix equations via MINIRES algorithm. J. Frankl. I 354, 6381\u20136404 (2017)","journal-title":"J. Frankl. I"},{"key":"692_CR39","first-page":"138","volume":"11","author":"BH Huang","year":"2018","unstructured":"Huang, B.H., Ma, C.F.: Extending GCR Algorithm for the least squares solutions on a class of Sylvester matrix equations. Numer. Math. Theor. Methods Appl. 11, 138\u2013157 (2018)","journal-title":"Numer. Math. Theor. Methods Appl."},{"key":"692_CR40","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1007\/s11075-017-0423-9","volume":"78","author":"BH Huang","year":"2018","unstructured":"Huang, B.H., Ma, C.F.: An iterative algorithm for the least Frobenius norm Hermitian and generalized skew Hamiltonian solutions of the generalized coupled Sylvester-conjugate matrix equations. Numer. Algorithms 78, 1271\u20131301 (2018)","journal-title":"Numer. Algorithms"},{"key":"692_CR41","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1016\/j.camwa.2017.04.035","volume":"74","author":"BH Huang","year":"2017","unstructured":"Huang, B.H., Ma, C.F.: On the least squares generalized Hamiltonian solution of generalized coupled Sylvester-conjugate matrix equations. Comput. Math. Appl. 74, 532\u2013555 (2017)","journal-title":"Comput. Math. Appl."},{"key":"692_CR42","first-page":"1","volume":"2014","author":"N Huang","year":"2014","unstructured":"Huang, N., Ma, C.F.: The iteration solution of matrix equation \n                    \n                      \n                    \n                    $$AXB=C$$\n                    \n                      \n                        \n                          A\n                          X\n                          B\n                          =\n                          C\n                        \n                      \n                    \n                   subject to a linear matrix inequality constraint. Abs. Appl. Anal. 2014, 1\u20139 (2014)","journal-title":"Abs. Appl. Anal."},{"key":"692_CR43","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1080\/01630563.2017.1349795","volume":"39","author":"YF Ke","year":"2018","unstructured":"Ke, Y.F., Ma, C.F.: An alternating direction method for a class of Sylvester matrix equations with linear matrix inequality constraint. Numer. Funct. Anal. Opt. 39, 257\u2013275 (2018)","journal-title":"Numer. Funct. Anal. Opt."},{"key":"692_CR44","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TAC.1987.1104623","volume":"32","author":"BH Kwon","year":"1987","unstructured":"Kwon, B.H., Youn, M.J.: Eigenvalue-generalized eigenvector assignment by output feedback. IEEE Trans. Autom. Control 32, 417\u2013421 (1987)","journal-title":"IEEE Trans. Autom. Control"},{"key":"692_CR45","first-page":"719","volume":"226","author":"H Li","year":"2014","unstructured":"Li, H., Gao, Z., Zhao, D.: Least squares solutions of the matrix equation \n                    \n                      \n                    \n                    $$AXB + CYD = E$$\n                    \n                      \n                        \n                          A\n                          X\n                          B\n                          +\n                          C\n                          Y\n                          D\n                          =\n                          E\n                        \n                      \n                    \n                   with the least norm for symmetric arrowhead matrices. Appl. Math. Comput. 226, 719\u2013724 (2014)","journal-title":"Appl. Math. Comput."},{"key":"692_CR46","first-page":"137","volume":"35","author":"JF Li","year":"2013","unstructured":"Li, J.F., Peng, Z.Y., Peng, J.J.: Bisymmetric solution of the matrix equation \n                    \n                      \n                    \n                    $$AX=B$$\n                    \n                      \n                        \n                          A\n                          X\n                          =\n                          B\n                        \n                      \n                    \n                   under a matrix inequality constraint. Math. Numer. Sin. 35, 137\u2013150 (2013)","journal-title":"Math. Numer. Sin."},{"key":"692_CR47","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10589-015-9783-z","volume":"63","author":"JF Li","year":"2016","unstructured":"Li, J.F., Li, W., Huang, R.: An efficient method for solving a matrix least squares problem over a matrix inequality constraint. Comput. Optim. Appl. 63, 393\u2013423 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"692_CR48","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1080\/03081087.2014.918118","volume":"63","author":"JF Li","year":"2015","unstructured":"Li, J.F., Li, W., Peng, Z.Y.: A hybrid algorithm for solving minimization problem over (\n                    \n                      \n                    \n                    $$R$$\n                    \n                      \n                        R\n                      \n                    \n                  ,\n                    \n                      \n                    \n                    $$S$$\n                    \n                      \n                        S\n                      \n                    \n                  )-symmetric matrices with the matrix inequality constraint. Linear Multilinear Algebra 63, 1049\u20131072 (2015)","journal-title":"Linear Multilinear Algebra"},{"key":"692_CR49","first-page":"3166","volume":"218","author":"KF Liang","year":"2011","unstructured":"Liang, K.F., Liu, J.Z.: Iterative algorithms for the minimum-norm solution and the least-squares solution of the linear matrix equations \n                    \n                      \n                    \n                    $$A_1XB_1+C_1X^TD_1=E_1$$\n                    \n                      \n                        \n                          \n                            A\n                            1\n                          \n                          X\n                          \n                            B\n                            1\n                          \n                          +\n                          \n                            C\n                            1\n                          \n                          \n                            X\n                            T\n                          \n                          \n                            D\n                            1\n                          \n                          =\n                          \n                            E\n                            1\n                          \n                        \n                      \n                    \n                  , \n                    \n                      \n                    \n                    $$A_2XB_2+C_2X^TD_2=E_2$$\n                    \n                      \n                        \n                          \n                            A\n                            2\n                          \n                          X\n                          \n                            B\n                            2\n                          \n                          +\n                          \n                            C\n                            2\n                          \n                          \n                            X\n                            T\n                          \n                          \n                            D\n                            2\n                          \n                          =\n                          \n                            E\n                            2\n                          \n                        \n                      \n                    \n                  . Appl. Math. Comput. 218, 3166\u20133175 (2011)","journal-title":"Appl. Math. Comput."},{"key":"692_CR50","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1080\/03081088308817543","volume":"14","author":"JR Magnus","year":"1983","unstructured":"Magnus, J.R.: L-structured matrices and linear matrix equation. Linear Multilinear Algebra Appl. 14, 67\u201388 (1983)","journal-title":"Linear Multilinear Algebra Appl."},{"key":"692_CR51","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mo\u0155e","year":"1983","unstructured":"Mo\u0155e, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"692_CR52","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1145\/321450.321459","volume":"15","author":"GR Morris","year":"1968","unstructured":"Morris, G.R., Odell, P.L.: Common solutions for n matrix equations with applications. J. Assoc. Comput. Mach. 15, 272\u2013274 (1968)","journal-title":"J. Assoc. Comput. Mach."},{"key":"692_CR53","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s40314-015-0226-3","volume":"36","author":"JJ Peng","year":"2017","unstructured":"Peng, J.J., Liao, A.P.: Algorithm for inequality-constrained least squares problems. Comput. Appl. Math. 36, 249\u2013258 (2017)","journal-title":"Comput. Appl. Math."},{"key":"692_CR54","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/100808678","volume":"33","author":"ZY Peng","year":"2012","unstructured":"Peng, Z.Y., Wang, L., Peng, J.J.: The solutions of matrix equation \n                    \n                      \n                    \n                    $$AX=B$$\n                    \n                      \n                        \n                          A\n                          X\n                          =\n                          B\n                        \n                      \n                    \n                   over a matrix inequality constraint. SIAM J. Matrix Anal. Appl. 33, 554\u2013568 (2012)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"692_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/asjc.805","volume":"16","author":"MA Ramadan","year":"2014","unstructured":"Ramadan, M.A., El-Danaf, T.S., Bayoumi, A.M.E.: A relaxed gradient based algorithm for solving extended Sylvester-conjugate matrix equations. Asian J. Control 16, 1\u20138 (2014)","journal-title":"Asian J. Control"},{"key":"692_CR56","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/S1064827500378167","volume":"23","author":"M Rojas","year":"2002","unstructured":"Rojas, M., Sorensen, D.C.: A trust-region approach to the regularization of large-scale discrete forms of ill-posed problems. SIAM J. Sci. Comput. 23, 1842\u20131860 (2002)","journal-title":"SIAM J. Sci. Comput."},{"key":"692_CR57","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1002\/asjc.780","volume":"16","author":"C Song","year":"2014","unstructured":"Song, C., Wang, X.D., Feng, J., Zhao, J.L.: Parametric solutions to the generalized discrete Yakubovich-transpose matrix equation. Asian J. Control 16, 1133\u20131140 (2014)","journal-title":"Asian J. Control"},{"key":"692_CR58","doi-asserted-by":"publisher","first-page":"2381","DOI":"10.2298\/FIL1708381T","volume":"31","author":"ZL Tian","year":"2017","unstructured":"Tian, Z.L., Tian, M.Y., Gu, C.Q., Hao, X.N.: An accelerated Jacobi-gradient based iterative algorithm for solving Sylvester matrix equations. Filomat 31, 2381\u20132390 (2017)","journal-title":"Filomat"},{"key":"692_CR59","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1080\/00207178808906052","volume":"47","author":"CC Tsui","year":"1988","unstructured":"Tsui, C.C.: New approach to robust observer design. Int. J. Control 47, 745\u2013751 (1988)","journal-title":"Int. J. Control"},{"key":"692_CR60","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0024-3795(02)00303-8","volume":"353","author":"QW Wang","year":"2002","unstructured":"Wang, Q.W., Sun, J.H., Li, S.Z.: Consistency for bi(skew)symmetric solutions to systems of generalized Sylvester equations over a finite central algebra. Linear Algebra Appl. 353, 169\u2013182 (2002)","journal-title":"Linear Algebra Appl."},{"key":"692_CR61","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00607-010-0100-5","volume":"89","author":"AG Wu","year":"2010","unstructured":"Wu, A.G., Duan, G.R., Fu, Y.M., Wu, W.J.: Finite iterative algorithms for the generalized Sylvester-conjugate matrix equation \n                    \n                      \n                    \n                    $$AX + BY = EXF + S$$\n                    \n                      \n                        \n                          A\n                          X\n                          +\n                          B\n                          Y\n                          =\n                          E\n                          X\n                          F\n                          +\n                          S\n                        \n                      \n                    \n                  . Computing 89, 147\u2013170 (2010)","journal-title":"Computing"},{"key":"692_CR62","doi-asserted-by":"publisher","first-page":"1564","DOI":"10.1080\/00207160.2015.1067310","volume":"93","author":"DX Xie","year":"2016","unstructured":"Xie, D.X., Xu, A.B., Peng, Z.Y.: Least squares symmetric solution to the matrix equation \n                    \n                      \n                    \n                    $$AXB=C$$\n                    \n                      \n                        \n                          A\n                          X\n                          B\n                          =\n                          C\n                        \n                      \n                    \n                   with the norm inequality constraint. Int. J. Comput. Math. 93, 1564\u20131578 (2016)","journal-title":"Int. J. Comput. Math."},{"key":"692_CR63","first-page":"2191","volume":"217","author":"L Xie","year":"2010","unstructured":"Xie, L., Liu, Y.J., Yang, H.Z.: Gradient based and least squares based iterative algorithms for matrix equations \n                    \n                      \n                    \n                    $$AXB + CX^TD = F$$\n                    \n                      \n                        \n                          A\n                          X\n                          B\n                          +\n                          C\n                          \n                            X\n                            T\n                          \n                          D\n                          =\n                          F\n                        \n                      \n                    \n                  . Appl. Math. Comput. 217, 2191\u20132199 (2010)","journal-title":"Appl. Math. Comput."},{"key":"692_CR64","first-page":"1257","volume":"273","author":"YJ Xie","year":"2016","unstructured":"Xie, Y.J., Ma, C.F.: The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation. Appl. Math. Comput. 273, 1257\u20131269 (2016)","journal-title":"Appl. Math. Comput."},{"key":"692_CR65","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1002\/asjc.448","volume":"14","author":"C Yang","year":"2012","unstructured":"Yang, C., Liu, J., Liu, Y.: Solutions of the generalized Sylvester matrix equation and the application in eigenstructure assignment. Asian J. Control 14, 1669\u20131675 (2012)","journal-title":"Asian J. Control"},{"key":"692_CR66","first-page":"29","volume":"18","author":"YX Yuan","year":"2004","unstructured":"Yuan, Y.X.: Least squares solutions of matrix equation \n                    \n                      \n                    \n                    $$AXB=E$$\n                    \n                      \n                        \n                          A\n                          X\n                          B\n                          =\n                          E\n                        \n                      \n                    \n                  , \n                    \n                      \n                    \n                    $$CXD=F$$\n                    \n                      \n                        \n                          C\n                          X\n                          D\n                          =\n                          F\n                        \n                      \n                    \n                  . J. East China Shipbuild. Inst. 18, 29\u201331 (2004)","journal-title":"J. East China Shipbuild. Inst."},{"key":"692_CR67","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1016\/j.jfranklin.2015.04.003","volume":"353","author":"HM Zhang","year":"2016","unstructured":"Zhang, H.M., Ding, F.: Iterative algorithms for \n                    \n                      \n                    \n                    $$X+A^TX^{-1}A =I$$\n                    \n                      \n                        \n                          X\n                          +\n                          \n                            A\n                            T\n                          \n                          \n                            X\n                            \n                              -\n                              1\n                            \n                          \n                          A\n                          =\n                          I\n                        \n                      \n                    \n                   by using the hierarchical identification principle. J. Frankl. I 353, 1132\u20131146 (2016)","journal-title":"J. Frankl. I"},{"key":"692_CR68","first-page":"950","volume":"243","author":"AJ Liu","year":"2014","unstructured":"Liu, A.J., Chen, G.L.: On the Hermitian positive definite solutions of nonlinear matrix equation \n                    \n                      \n                    \n                    $$X^s+\\sum \\limits_{i=1}^{m}A_i^*X^{-t_i}A_i=Q$$\n                    \n                      \n                        \n                          \n                            X\n                            s\n                          \n                          +\n                          \n                            \u2211\n                            \n                              i\n                              =\n                              1\n                            \n                            m\n                          \n                          \n                            A\n                            i\n                            \u2217\n                          \n                          \n                            X\n                            \n                              -\n                              \n                                t\n                                i\n                              \n                            \n                          \n                          \n                            A\n                            i\n                          \n                          =\n                          Q\n                        \n                      \n                    \n                  . Appl. Math. Comput. 243, 950\u2013959 (2014)","journal-title":"Appl. Math. Comput."},{"key":"692_CR69","doi-asserted-by":"crossref","unstructured":"Liu, A.J. L., Chen G.L., Zhang X.Y.: A new method for the bisymmetric minimum norm solution of the consistent matrix equations\n                    \n                      \n                    \n                    $$A_1XB_1=C_1, A_2XB_2=C_2$$\n                    \n                      \n                        \n                          \n                            A\n                            1\n                          \n                          X\n                          \n                            B\n                            1\n                          \n                          =\n                          \n                            C\n                            1\n                          \n                          ,\n                          \n                            A\n                            2\n                          \n                          X\n                          \n                            B\n                            2\n                          \n                          =\n                          \n                            C\n                            2\n                          \n                        \n                      \n                    \n                  . J. Appl. Math., 125687 (2013)","DOI":"10.1155\/2013\/125687"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0692-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0692-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0692-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T08:05:51Z","timestamp":1565769951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0692-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,24]]},"references-count":69,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["692"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0692-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2018,7,24]]},"assertion":[{"value":"12 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}