Algorithm and separating method for the optimisation of quadratic functions
by Amel Belabbaci; Bachir Djebbar
International Journal of Computing Science and Mathematics (IJCSM), Vol. 8, No. 2, 2017

Abstract: This paper addresses the optimisation of quadratic functions on convex polyhedrons. We propose a method and an algorithm for optimising a strictly concave function. This algorithm uses a good initialisation by searching the nearest vertex of a convex set to an external point in order to surround the area where the optimal solution can be located. The optimal solution may be the nearest vertex found or a boundary point obtained by the projection of the critical point onto a separating hyperplane passing through the nearest vertex. This method and this algorithm can be adapted for the convex quadratic problem. In this case, the optimal solution is the farthest vertex from the critical point.

Online publication date: Fri, 21-Apr-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com