Abstract
This paper studies the canonical duality theory for solving a class of quadrinomial minimization problems subject to one general quadratic constraint. It is shown that the nonconvex primal problem in $${\mathbb {R}^n}$$ can be converted into a concave maximization dual problem over a convex set in $${\mathbb {R}^2}$$ , such that the problem can be solved more efficiently. The existence and uniqueness theorems of global minimizers are provided using the triality theory. Examples are given to illustrate the results obtained.
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.