Robust trade-off portfolio selection (Q2218875)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7297583
Language Label Description Also known as
default for all languages
No label defined
    English
    Robust trade-off portfolio selection
    scientific article; zbMATH DE number 7297583

      Statements

      Robust trade-off portfolio selection (English)
      0 references
      0 references
      0 references
      18 January 2021
      0 references
      The authors analyze the trade-off between two robust criteria in mean-variance portfolio optimization when there is parameter uncertainty: maximin utility and minimax regret. This approach is motivated by the observation that the portfolio chosen by either criterion may degenerate to one of the most uninformative portfolios. More precisely, while optimizing for the worst-case utility may yield an overly pessimistic portfolio, optimizing for the worst-case regret may result in a complete loss of robustness; it is demonstrated in the paper. Thus, seeking a trade-off between the two portfolios is sometimes necessary, not only desirable. On this way, it is proved that, under a widely used ellipsoidal uncertainty model, the entire optimal trade-off curve can be found via solving a series of semidefinite programs (SDPs). Then the model is extended to handle the union of finitely many ellipsoids, and it is shown that trade-off analysis under this quite general uncertainty model also reduces to a series of SDPs. For more general uncertainties, an iterative algorithm is proposed based on the cutting-set method.
      0 references
      minimax regret
      0 references
      portfolio optimization
      0 references
      robust optimization
      0 references
      robust portfolio optimization
      0 references
      semidefinite programming
      0 references
      ellipsoidal uncertainty model
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers