Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs

DOI10.1007/S10898-004-2703-XzbMath1123.90078OpenAlexW1996859694MaRDI QIDQ2576446

Rei Yamamoto, Hiroshi Konno

Publication date: 13 December 2005

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-2703-x

zbMATH Keywords

Global optimizationBranch and bound algorithm0-1 integer programmingNonconvex transaction costPortfolio optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Interior-point methods (90C51) Portfolio theory (91G10)

Related Items (15)

Portfolio rebalancing model with transaction costs using interval optimization ⋮ A MAXIMAL PREDICTABILITY PORTFOLIO MODEL: ALGORITHM AND PERFORMANCE EVALUATION ⋮ Extracting from the relaxed for large-scale semi-continuous variable nondominated frontiers ⋮ Fuzzy multi-period portfolio selection model with discounted transaction costs ⋮ Fuzzy portfolio optimization with tax, transaction cost and investment amount: a developing country case ⋮ Successive smoothing algorithm for solving large-scale optimization models with fixed cost ⋮ An efficient algorithm for solving convex-convex quadratic fractional programs ⋮ A MAXIMAL PREDICTABILITY PORTFOLIO SUBJECT TO A TURNOVER CONSTRAINT ⋮ Dealing with complex transaction costs in portfolio management ⋮ A novel hybrid PSO-based metaheuristic for costly portfolio selection problems ⋮ Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm ⋮ DC programming approaches for discrete portfolio optimization under concave transaction costs ⋮ Twenty years of linear programming based portfolio optimization ⋮ DC programming approach for portfolio optimization under step increasing transaction costs ⋮ Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs

Cites Work

• Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints
• Minimal concave cost rebalance of a portfolio to the efficient frontier
• From stochastic dominance to mean-risk models: Semideviations as risk measures
• Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
• MINIMAL COST INDEX TRACKING UNDER NONLINEAR TRANSACTION COSTS AND MINIMAL TRANSACTION UNIT CONSTRAINTS
• Mean-absolute deviation portfolio optimization model under transaction costs
• An Algorithm for Separable Nonconvex Programming Problems

This page was built for publication: Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs