By Topic

A New Algorithm for Quadratic Programming with Interval-Valued Bound Constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Liang Fang ; Dept. of Math. & Syst. Sci., Taishan Univ., Tai'an ; Li Sun ; Guoping He ; Fangying Zheng

In this paper, we study the interval-valued convex quadratic programming with bound constraints. The membership functions of bound constraints are defined, and through solving two general quadratic programming, we define the membership function of objective function. Based on this, the problem is converted into a multi-objective programming by exploiting these membership functions. Finally, the multi-objective programming is converted into a semi-definite programming (SDP) using Schur complement theorem, which can be solved efficiently by using the existed software for SDP.

Published in:

2008 Fourth International Conference on Natural Computation  (Volume:6 )

Date of Conference:

18-20 Oct. 2008