Abstract
This article presents a global optimal solution to a quadratic minimization problem subjected to non-convex constraints. By using the canonical dual transformation developed by the first author, a canonical dual problem (with zero duality gap) is formulated which can be solved easily to obtain all critical points. The global minimizer is uniquely identified by the canonical duality theory. Applications are illustrated. The method and theory developed in this article can be generalized for solving general global optimization problems subjected to non-convex constraints.
Sign-in/Register to access full text options 
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.
