Exact Solutions to the Maxmin Problem max‖ Ax ‖ Subject to ‖ Bx ‖≤1
Soledad Moreno-Pulido, Francisco Javier Garcia-Pacheco, Clemente Cobos-Sanchez and 1 more
Mathematics · 2020
doi:10.3390/math8010085 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this manuscript we provide an exact solution to the maxmin problem <inline-formula> <math display="inline"> <semantics> <mrow> <mo movablelimits="true" form="prefix">max</mo> <mo>∥</mo> <mi>A</mi> <mi>x</mi> <mo>∥</mo> </mrow> </semantics> </math> </inline-formula> subject to <inline-formula> <math display="inline"> <semantics> <mrow> <mo>∥</mo> <mi>B</mi> <mi>x</mi> <mo>∥</mo> <mo>≤</mo> <mn>1</mn> </mrow> </semantics> </math> </inline-formula>, where <i>A</i> and <i>B</i> are real matrices. This problem comes from a remodeling of <inline-formula> <math display="inline"> <semantics> <mrow> <mo movablelimits="true" form="prefix">max</mo> <mo>∥</mo> <mi>A</mi> <mi>x</mi> <mo>∥</mo> </mrow> </semantics> </math> </inline-formula> subject to <inline-formula> <math display="inline"> <semantics> <mrow> <mo movablelimits="true" form="prefix">min</mo> <mo>∥</mo> <mi>B</mi> <mi>x</mi> <mo>∥</mo> </mrow> </semantics> </math> </inline-formula>, 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 <inline-formula> <math display="inline"> <semantics> <mrow> <mo movablelimits="true" form="prefix">max</mo> <mo>∥</mo> <mi>C</mi> <mi>x</mi> <mo>∥</mo> </mrow> </semantics> </math> </inline-formula> subject to <inline-formula> <math display="inline"> <semantics> <mrow> <mo>∥</mo> <mi>x</mi> <mo>∥</mo> <mo>≤</mo> <mn>1</mn> </mrow> </semantics> </math> </inline-formula>, 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.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.