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

Ali Soltani and Behnam Tashakor

MPRA Paper from University Library of Munich, Germany

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.

Keywords: Convex optimization; math algorithm; unit commitment (search for similar items in EconPapers)
JEL-codes: A1 A10 C0 C3 K0 L0 O1 (search for similar items in EconPapers)
Date: 2019-01
New Economics Papers: this item is included in nep-cmp and nep-ore
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/94335/1/MPRA_paper_94335.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:94335

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().