Abstract
The paper studies optimization problems with polynomial objective functions and constraints in the form of inequalities. We propose a transformation of the solution method based on the theory of moments. This transformation allows to construct equivalent solution algorithms in the augmented original search space instead of the space of moments. Onedimensional optimization problems are explored in detail.
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.
