Abstract
We establish some properties of the Proximal Difference-of-Convex functions decomposition algorithm in indefinite quadratic programming under linear constraints. The first property states that any iterative sequence generated by the algorithm is root linearly convergent to a Karush–Kuhn–Tucker point, provided that the problem has a solution. The second property says that iterative sequences generated by the algorithm converge to a locally unique solution of the problem if the initial points are taken from a suitably chosen neighbourhood of it. Through a series of numerical tests, we analyse the influence of the decomposition parameter on the rate of convergence of the iterative sequences and compare the performance of the Proximal Difference-of-Convex functions decomposition algorithm with that of the Projection Difference-of-Convex functions decomposition algorithm. In addition, the performances of the above algorithms and the Gurobi software in solving some randomly generated nonconvex quadratic programs are compared.
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.
