Partitioning Procedure for Polynomial Optimization: Application to Portfolio Decisions with Higher Order Moments
AbstractWe consider the problem of finding the minimum of a real-valued multivariate polynomial function constrained in a compact set defined by polynomial inequalities and equalities. This problem, called polynomial optimization problem (POP), is generally nonconvex and has been of growing interest to many researchers in recent years. Our goal is to tackle POPs using decomposition. Towards this goal we introduce a partitioning procedure. The problem manipulations are in line with the pattern used in the Benders decomposition , namely relaxation preceded by projection. Stengle’s and Putinar’s Positivstellensatz are employed to derive the so-called feasibility and optimality constraints, respectively. We test the performance of the proposed method on a collection of benchmark problems and we present the numerical results. As an application, we consider the problem of selecting an investment portfolio optimizing the mean, variance, skewness and kurtosis of the portfolio.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by COMISEF in its series Working Papers with number 023.
Length: 30 pages
Date of creation: 10 Nov 2009
Date of revision:
Contact details of provider:
Web page: http://www.comisef.eu
Polynomial optimization; Semidefinite relaxations; Positivstellensatz; Sum of squares; Benders decomposition; Portfolio optimization;
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anil Khuman).
If references are entirely missing, you can add them using this form.