Abstract
The article presents a study on a class of polynomial optimization problems over (noncompact) semi-algebraic sets which, by making changes of variables via suitable monomial mappings, become polynomial optimization problems over compact semi-algebraic feasible sets. It is known that the polynomial optimization problems on semi-algebraic feasible sets are satisfactory when the feasible sets are compact. Furthermore, determining whether a polynomial is bounded on such a semi-algebraic set can be replaced by checking whether its support lies in a closed and convex cone corresponding to the semi-algebraic set.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
