Abstract
This paper presents a class of differential flows to solve concave quadratic programming problems under box constraints. Some properties of the flow are given to reveal the significant relationship between the dynamic of the flow and the geometry of the feasible set. It is shown how the differential flow reaches a vertex point of the box, leading to a global minimizer of the concave quadratic programming. Some illustrative examples are also presented.
Published Version
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.
