Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints
From MaRDI portal
Publication:598593
DOI10.1023/A:1013850928936zbMATH Open1045.91022OpenAlexW1810055MaRDI QIDQ598593FDOQ598593
Authors: Hiroshi Konno, Annista Wijayanayake
Publication date: 12 August 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013850928936
Recommendations
- Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
- Optimization of a long-short portfolio under nonconvex transaction cost
- DC programming approach for portfolio optimization under step increasing transaction costs
- Mean-absolute deviation portfolio optimization model under transaction costs
- Portfolio optimization with linear and fixed transaction costs
D.c. programmingMean-absolute deviation modelMinimal transaction unit constraintNonconvex transaction costPortfolio optimization
Cited In (22)
- A multi-period fuzzy portfolio optimization model with minimum transaction lots
- An optimization model for minimizing systemic risk
- DC programming approach for portfolio optimization under step increasing transaction costs
- Optimization of a long-short portfolio under nonconvex transaction cost
- An exact algorithm for factor model in portfolio selection with roundlot constraints
- Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
- Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs
- Possibilistic approaches to portfolio selection problem with general transaction costs and a CLPSO algorithm
- A branch and reduce approach for solving a class of low rank d.c. programs
- Application of artificial bee colony algorithm to portfolio adjustment problem with transaction costs
- An amendatory branch and bound algorithm for MAD model with concave transaction costs and bounded assets constraints
- MINIMAL COST INDEX TRACKING UNDER NONLINEAR TRANSACTION COSTS AND MINIMAL TRANSACTION UNIT CONSTRAINTS
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
- A risk tolerance model for portfolio adjusting problem with transaction costs based on possibilistic moments
- Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
- Extracting from the relaxed for large-scale semi-continuous variable nondominated frontiers
- Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm
- Mean-absolute deviation portfolio optimization model under transaction costs
- Mean-variance portfolio optimal problem under concave transaction cost
- Matrix decomposition and Lagrangian dual method for discrete portfolio optimization under concave transaction costs
- A note on mean absolute deviation
- A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint
This page was built for publication: Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598593)