Munich Personal RePEc Archive

A New Nonconvex quadratic programming Technique: Practical and Fast Solver Method

Soltani, Ali and Tashakor, Behnam (2019): A New Nonconvex quadratic programming Technique: Practical and Fast Solver Method.

[img] PDF
MPRA_paper_94335.pdf

Download (408kB)

Abstract

There exist many problems that nonconvex which are hard to solve. To overcome the nonconvexity of the problems, this paper presents a novel YALMIP-based nonconvex quadratic programming model to overcome the nonconvex problem. The proposed method is accurate, and no need to convexify the problem. Finally, some results are presented to show the effectiveness and merit of the model.

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.