Abstract
Given polynomial maps \(f, g \colon \mathbb {R}^{n} \to \mathbb {R}^{n}\), we consider the polynomial complementary problem of finding a vector \(x \in \mathbb {R}^{n}\) such that $$ f(x) \ge 0, \quad g(x) \ge 0, \quad \text{ and } \quad \langle f(x), g(x) \rangle = 0. $$ In this paper, we present various properties on the solution set of the problem, including genericity, nonemptiness, compactness, uniqueness as well as error bounds with explicit exponents. These strengthen and generalize some previously known results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.