Some commutation principles for optimization problems over transformation groups and semi-FTvN systems
M. Seetharama Gowda, David Sossa
TL;DR
This work introduces two notions of commutativity in optimization: commutativity relative to a transformation group ${\cal G}$ and strong commutativity within semi-FTvN systems. It proves that strong commutativity implies commutativity and shows that, in Euclidean Jordan algebras, commutativity relative to algebra automorphisms reduces to operator commutativity, unifying several classical notions. The authors establish that complete hyperbolic polynomials induce semi-FTvN systems, linking spectral mappings to optimization structure, and they derive a suite of commutation principles that generalize prior FTvN-system results to broader group-based and hyperbolic-polynomial contexts. The results provide a versatile algebraic-analytic framework for obtaining optimality conditions in structured optimization problems, with concrete instances in Jordan algebras and hyperbolic-polynomial systems. Collectively, the paper extends commutativity principles to new settings and highlights their role as fundamental optimality conditions across transformation-group and spectral-geometry frameworks.
Abstract
We introduce the concepts of commutativity relative to a transformation group and strong commutativity in the setting of a semi-FTvN system and show their appearance as optimality conditions in certain optimization problems. In the setting of a semi-FTvN system (in particular, in an FTvN system), we show that strong commutativity implies commutativity and observe that in the special case of Euclidean Jordan algebra, commutativity and strong commutativity concepts reduce, respectively, to those of operator and strong operator commutativity. We demonstrate that every complete hyperbolic polynomial induces a semi-FTvN system. By way of an application, we describe several commutation principles.
