Longfei Wang, Yu Chen, Hongwei Jiao, Yunhai Xiao, Meijia Yang
{"title":"Globally maximizing the ratio of two generalized quadratic matrix form functions over the Stiefel manifold","authors":"Longfei Wang, Yu Chen, Hongwei Jiao, Yunhai Xiao, Meijia Yang","doi":"10.1007/s11075-024-01939-0","DOIUrl":null,"url":null,"abstract":"<p>We consider the problem of maximizing the ratio of two generalized quadratic matrix form functions over the Stiefel manifold, i.e., <span>\\(\\max \\limits _{X^{T}X=I} \\frac{\\text {tr}(GX^{T}AX)}{\\text {tr}(GX^{T}BX)}\\)</span> (RQMP). We utilize the Dinkelbach algorithm to globally solve RQMP, where each subproblem is evaluated by the closed-form solution. For a special case of RQMP with <span>\\(AB=BA\\)</span>, we propose an equivalent linear programming problem. Numerical experiments demonstrate that it is more efficient than the recent SDP-based algorithm.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":"47 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Algorithms","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11075-024-01939-0","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
We consider the problem of maximizing the ratio of two generalized quadratic matrix form functions over the Stiefel manifold, i.e., \(\max \limits _{X^{T}X=I} \frac{\text {tr}(GX^{T}AX)}{\text {tr}(GX^{T}BX)}\) (RQMP). We utilize the Dinkelbach algorithm to globally solve RQMP, where each subproblem is evaluated by the closed-form solution. For a special case of RQMP with \(AB=BA\), we propose an equivalent linear programming problem. Numerical experiments demonstrate that it is more efficient than the recent SDP-based algorithm.
期刊介绍:
The journal Numerical Algorithms is devoted to numerical algorithms. It publishes original and review papers on all the aspects of numerical algorithms: new algorithms, theoretical results, implementation, numerical stability, complexity, parallel computing, subroutines, and applications. Papers on computer algebra related to obtaining numerical results will also be considered. It is intended to publish only high quality papers containing material not published elsewhere.