IDEAS home Printed from https://ideas.repec.org/p/tiu/tiucen/3789955a-6533-4a4e-aca2-6dd7244fab83.html
   My bibliography  Save this paper

On the Complexity of Optimization over the Standard Simplex

Author

Listed:
  • de Klerk, E.

    (Tilburg University, Center For Economic Research)

  • den Hertog, D.

    (Tilburg University, Center For Economic Research)

  • Elfadul, G.E.E.

    (Tilburg University, Center For Economic Research)

Abstract

We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approximating the minimum of some classes of functions (including Lipschitz continuous functions) on the standard simplex. The main tools used in the analysis are Bernstein approximation and Lagrange interpolation on the simplex combined with an earlier result by de Klerk et al. [A PTAS for the minimization of polynomials of fixed degree over the simplex, Theoretical Computer Science 361 (2-3) (2006) 210-225].
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • de Klerk, E. & den Hertog, D. & Elfadul, G.E.E., 2005. "On the Complexity of Optimization over the Standard Simplex," Discussion Paper 2005-125, Tilburg University, Center for Economic Research.
    • Handle: RePEc:tiu:tiucen:3789955a-6533-4a4e-aca2-6dd7244fab83
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/776650/125.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Bertsimas, Dimitris & Lauprete, Geoffrey J. & Samarov, Alexander, 2004. "Shortfall as a risk measure: properties, optimization and applications," Journal of Economic Dynamics and Control, Elsevier, vol. 28(7), pages 1353-1381, April.
    2. A.M. Bagirov & A.M. Rubinov, 2000. "Global Minimization of Increasing Positively Homogeneous Functions over the Unit Simplex," Annals of Operations Research, Springer, vol. 98(1), pages 171-187, December.
    3. de Klerk, E. & Laurent, M. & Parrilo, P., 2006. "A PTAS for the minimization of polynomials of fixed degree over the simplex," Other publications TiSEM 603897c9-179e-43e4-9e83-6, Tilburg University, School of Economics and Management.
    4. Carlo Acerbi & Dirk Tasche, 2002. "Expected Shortfall: A Natural Coherent Alternative to Value at Risk," Economic Notes, Banca Monte dei Paschi di Siena SpA, vol. 31(2), pages 379-388, July.
    5. NESTEROV, Yu. & WOLKOWICZ, Henry & YE, Yinyu, 2000. "Semidefinite programming relaxations of nonconvex quadratic optimization," LIDAM Reprints CORE 1471, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. de Klerk, E. & Elfadul, G.E.E. & den Hertog, D., 2006. "Optimization of Univariate Functions on Bounded Intervals by Interpolation and Semidefinite Programming," Discussion Paper 2006-26, Tilburg University, Center for Economic Research.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. James Chok & Geoffrey M. Vasil, 2023. "Convex optimization over a probability simplex," Papers 2305.09046, arXiv.org.
    2. Immanuel Bomze & Stefan Gollowitzer & E. Yıldırım, 2014. "Rounding on the standard simplex: regular grids for global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 243-258, July.
    3. Titi, Jihad & Garloff, Jürgen, 2017. "Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 246-258.
    4. Tareq Hamadneh & Hassan Al-Zoubi & Saleh Ali Alomari, 2020. "Fast Computation of Polynomial Data Points Over Simplicial Face Values," Journal of Information & Knowledge Management (JIKM), World Scientific Publishing Co. Pte. Ltd., vol. 19(01), pages 1-13, March.
    5. Sadek, Lakhlifa & Bataineh, Ahmad Sami & Isik, Osman Rasit & Alaoui, Hamad Talibi & Hashim, Ishak, 2023. "A numerical approach based on Bernstein collocation method: Application to differential Lyapunov and Sylvester matrix equations," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 212(C), pages 475-488.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. de Klerk, E. & Laurent, M., 2010. "Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube," Other publications TiSEM 619d9658-77df-4b5e-9868-0, Tilburg University, School of Economics and Management.
    2. de Klerk, E. & den Hertog, D. & Elfadul, G.E.E., 2005. "On the Complexity of Optimization over the Standard Simplex," Other publications TiSEM 3789955a-6533-4a4e-aca2-6, Tilburg University, School of Economics and Management.
    3. Marcelo Brutti Righi & Paulo Sergio Ceretta, 2015. "Shortfall Deviation Risk: An alternative to risk measurement," Papers 1501.02007, arXiv.org, revised May 2016.
    4. Wayne King Ming Chan, 2015. "RAROC-Based Contingent Claim Valuation," PhD Thesis, Finance Discipline Group, UTS Business School, University of Technology, Sydney, number 21, July-Dece.
    5. Alexis Bonnet & Isabelle Nagot, 2005. "Methodology of measuring performance in alternative investment," Cahiers de la Maison des Sciences Economiques b05078, Université Panthéon-Sorbonne (Paris 1).
    6. Lisa R. Goldberg & Michael Y. Hayes & Ola Mahmoud, 2013. "Minimizing shortfall," Quantitative Finance, Taylor & Francis Journals, vol. 13(10), pages 1533-1545, October.
    7. De Giorgi, Enrico, 2005. "Reward-risk portfolio selection and stochastic dominance," Journal of Banking & Finance, Elsevier, vol. 29(4), pages 895-926, April.
    8. Oliver Janke, 2016. "Utility Maximization and Indifference Value under Risk and Information Constraints for a Market with a Change Point," Papers 1610.08644, arXiv.org.
    9. Lisa R. Goldberg & Ola Mahmoud, 2014. "Drawdown: From Practice to Theory and Back Again," Papers 1404.7493, arXiv.org, revised Sep 2016.
    10. Broda, Simon A. & Krause, Jochen & Paolella, Marc S., 2018. "Approximating expected shortfall for heavy-tailed distributions," Econometrics and Statistics, Elsevier, vol. 8(C), pages 184-203.
    11. Alexis Bonnet & Isabelle Nagot, 2005. "Methodology of measuring performance in alternative investment," Post-Print halshs-00196443, HAL.
    12. Sungchul Hong & Jong-June Jeon, 2023. "Uniform Pessimistic Risk and Optimal Portfolio," Papers 2303.07158, arXiv.org.
    13. Elisabetta Cagna & Giulio Casuccio, 2014. "Equally-weighted Risk Contribution Portfolios: an empirical study using expected shortfall," CeRP Working Papers 142, Center for Research on Pensions and Welfare Policies, Turin (Italy).
    14. Goldberg, Lisa R & Mouti, Saad, 2022. "Sustainable investing and the cross-section of returns and maximum drawdown," Department of Economics, Working Paper Series qt98f9410b, Department of Economics, Institute for Business and Economic Research, UC Berkeley.
    15. Brandtner, Mario, 2013. "Conditional Value-at-Risk, spectral risk measures and (non-)diversification in portfolio selection problems – A comparison with mean–variance analysis," Journal of Banking & Finance, Elsevier, vol. 37(12), pages 5526-5537.
    16. Andrew Chen & Frank Fabozzi & Dashan Huang, 2012. "Portfolio revision under mean-variance and mean-CVaR with transaction costs," Review of Quantitative Finance and Accounting, Springer, vol. 39(4), pages 509-526, November.
    17. Melenberg, B. & Polbennikov, S.Y., 2005. "Testing for Mean-Coherent Regular Risk Spanning," Other publications TiSEM 0cd9ce8d-542e-418e-be38-f, Tilburg University, School of Economics and Management.
    18. Melenberg, B. & Polbennikov, S.Y., 2005. "Testing for Mean-Coherent Regular Risk Spanning," Discussion Paper 2005-99, Tilburg University, Center for Economic Research.
    19. Winter, Peter, 2007. "Managerial Risk Accounting and Control – A German perspective," MPRA Paper 8185, University Library of Munich, Germany.
    20. Rubinov, A.M. & Soukhorokova, N.V. & Ugon, J., 2006. "Classes and clusters in data analysis," European Journal of Operational Research, Elsevier, vol. 173(3), pages 849-865, September.

    More about this item

    Keywords

    global optimization; standard simplex; PTAS; multivariate Bernstein approximation; semidefinite programming;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    Statistics

    Access and download statistics

    Corrections

    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:tiu:tiucen:3789955a-6533-4a4e-aca2-6dd7244fab83. See general information about how to correct material in RePEc.

    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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Richard Broekman (email available below). General contact details of provider: http://center.uvt.nl .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.