Abstract
In this manuscript we provide an exact solution to the maxmin problem max ∥ A x ∥ subject to ∥ B x ∥ ≤ 1 , where A and B are real matrices. This problem comes from a remodeling of max ∥ A x ∥ subject to min ∥ B x ∥ , because the latter problem has no solution. Our mathematical method comes from the Abstract Operator Theory, whose strong machinery allows us to reduce the first problem to max ∥ C x ∥ subject to ∥ x ∥ ≤ 1 , which can be solved exactly by relying on supporting vectors. Finally, as appendices, we provide two applications of our solution: first, we construct a truly optimal minimum stored-energy Transcranian Magnetic Stimulation (TMS) coil, and second, we find an optimal geolocation involving statistical variables.
Funder
European Regional Development Fund
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Pareto vectors of continuous linear operators;Journal of Inequalities and Applications;2023-12-21
2. Supporting vectors vs. principal components;AIMS Mathematics;2023
3. Analytical Solutions to Minimum-Norm Problems;Mathematics;2022-04-26
4. Revisiting the minimum-norm problem;Journal of Inequalities and Applications;2022-02-10
5. Supporting vectors for the ℓ_p-norm;Journal of Mathematical Inequalities;2022