arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2010.05020math.OC
收藏

关于某些二次规划问题的对称群

On Symmetry Groups of Some Quadratic Programming Problems

A. V. Eremeev, A. S. Yurkov

摘要:

当数学规划问题在适当的线性变换下是对称的时,这些问题的求解和分析可以简化。特别是,对称性的知识可以帮助减少问题的维数,削减搜索空间的线性切割或获得新的局部最优从以前发现的,而以前的研究中的对称性的数学规划通常处理的坐标排列的解决方案空间,本文考虑了一个更大的组可逆线性变换。研究了二次规划问题的一种特殊情况,其中目标函数和约束条件均由二次型给出,且约束条件所涉及的所有二次型矩阵之和是一个正定矩阵.在这种情况下,只考虑解空间的正交变换就足够了。在这组正交变换中,我们描述了给出问题对称性的子群的结构。除此之外,还概述了寻找这种对称性的方法,并以两个简单的例子加以说明。

英文摘要:

Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut the search space by linear cuts or obtain new local optima from the ones previously found. While the previous studies of symmetries in the mathematical programming usually dealt with permutations of coordinates of the solutions space, the present paper considers a larger group of invertible linear transformations. We study a special case of the quadratic programming problem, where the objective function and constraints are given by quadratic forms, and the sum of all matrices of quadratic forms, involved in the constraints, is a positive definite matrix. In this setting, it is sufficient to consider only orthogonal transformations of the solution space. In this group of orthogonal transformations, we describe the structure of the subgroup which gives the symmetries of the problem. Besides that, a method for finding such symmetries is outlined, and illustrated in two simple examples.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑