Deciding lower-boundedness of polynomials
Nguyen Hong Duc, Vu Trung Hieu
TL;DR
This paper investigates the problem of determining whether a given real polynomial in multiple variables is bounded below, which is fundamental in optimization and real algebraic geometry.
Contribution
It introduces new methods or criteria for deciding the lower-boundedness of arbitrary multivariate polynomials.
Findings
Proposes a novel decision procedure for lower-boundedness
Establishes theoretical conditions for boundedness
Demonstrates effectiveness on various polynomial classes
Abstract
This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Banach Space Theory · Functional Equations Stability Results · Holomorphic and Operator Theory