A polynomial optimization approach to constant rebalanced portfolio selection
From MaRDI portal
Publication:694522
DOI10.1007/s10589-011-9436-9zbMath1259.91080OpenAlexW2007383769MaRDI QIDQ694522
Publication date: 12 December 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9436-9
mean-variance criterionpolynomial optimization problemconstant rebalancingmulti-period portfolio optimization
Uses Software
Cites Work
- Constant rebalanced portfolio optimization under nonlinear transaction costs
- Linear and nonlinear programming.
- Asymptotic optimality and asymptotic equipartiton properties of log- optimum investment
- Solving long-term financial planning problems via global optimization
- Semidefinite programming relaxations for semialgebraic problems
- Portfolio optimization under lower partial risk measures
- The performance of stochastic dynamic and fixed mix portfolio models
- Sparsity in sums of squares of polynomials
- A polyhedral branch-and-cut approach to global optimization
- Symmetry groups, semidefinite programs, and sums of squares
- Global Optimization with Polynomials and the Problem of Moments
- Coherent Measures of Risk
- An algorithm for maximizing expected log investment return
- GloptiPoly 3: moments, optimization and semidefinite programming
- CONOPT—A Large-Scale GRG Code
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- On the global minimization of the value-at-risk
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- A MEAN-VARIANCE-SKEWNESS MODEL: ALGORITHM AND APPLICATIONS
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
This page was built for publication: A polynomial optimization approach to constant rebalanced portfolio selection