Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
Open Access
- 1 January 2014
- journal article
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 10 (2) , 543-556
Abstract
Multicriterion optimization and Pareto optimality are fundamental tools in economics. In this paper we propose a new relaxation method for solving multiple objective quadratic programming problems. Exploiting the technique of the linear weighted sum method, we reformulate the original multiple objective quadratic programming problems into a single objective one. Since such single objective quadratic programming problem is still nonconvex and NP-hard in general. By using the techniques of lifting and doubly nonnegative relaxation, respectively, this single objective quadratic programming problem is transformed to a computable convex doubly nonnegative programming problem. The optimal solutions of this computable convex problem are (weakly) Pareto optimal solutions of the original problem under some mild conditions. Moreover, the proposed method is tested with two examples and a practical portfolio selection example. The test examples are solved by CVX package which is a solver for convex optimization. The numerical results show that the proposed method is effective and promising.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Copositive optimization – Recent developments and applicationsEuropean Journal of Operational Research, 2012
- Nonsmooth optimization over the (weakly or properly) Pareto set of a linear-quadratic multi-objective control problem: Explicit optimality conditionsJournal of Industrial and Management Optimization, 2011
- Optimizing a polyhedral-semidefinite relaxation of completely positive programsMathematical Programming Computation, 2010
- On fuzzy random multiobjective quadratic programmingEuropean Journal of Operational Research, 2009
- On the copositive representation of binary and continuous nonconvex quadratic programsMathematical Programming, 2008
- Multiobjective Optimization for Reconfigurable Implementation of Medical Image RegistrationInternational Journal of Reconfigurable Computing, 2008
- On solutions of fuzzy random multiobjective quadratic programming with applications in portfolio problemInformation Sciences, 2008
- Completely Positive Matrices2003
- A reference direction approach to multiple objective quadratic-linear programmingEuropean Journal of Operational Research, 1997
- On non-negative forms in real variables some or all of which are non-negativeMathematical Proceedings of the Cambridge Philosophical Society, 1962