IDEAS home Printed from
   My bibliography  Save this paper

Partitioning Procedure for Polynomial Optimization: Application to Portfolio Decisions with Higher Order Moments


  • P. M. Kleniati
  • Panos Parpas
  • Berc Rustem


We 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 [1], 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.

Suggested Citation

  • P. M. Kleniati & Panos Parpas & Berc Rustem, 2009. "Partitioning Procedure for Polynomial Optimization: Application to Portfolio Decisions with Higher Order Moments," Working Papers 023, COMISEF.
  • Handle: RePEc:com:wpaper:023

    Download full text from publisher

    File URL:
    Download Restriction: no

    More about this item


    Polynomial optimization; Semidefinite relaxations; Positivstellensatz; Sum of squares; Benders decomposition; Portfolio optimization;

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:com:wpaper:023. See general 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). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.