New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming

In this work, we propose a new approach called “Successive Linear Programming Algorithm (SLPA)” for finding an approximate global minimizer of general nonconvex quadratic programs. This algorithm can be initialized by any extreme point of the convex polyhedron of the feasible domain. Furthermore, we...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 82; no. 4; pp. 659 - 689
Main Authors:	Bentobache, Mohand, Telli, Mohamed, Mokhtari, Abdelkader
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2022 Springer Springer Nature B.V
Subjects:	Algorithms Computer Science Linear programming Mathematics Mathematics and Statistics Mixed integer Operations Research/Decision Theory Optimization Quadratic programming Real Functions 90C20 Local minimizer Nonconvex quadratic programming Concave quadratic programming Extreme point 90C26 90C59 Successive linear programming Global minimizer Numerical experiments Approximate global minimizer Simplex algorithm
ISSN:	0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!