A mean-absolute deviation-skewness portfolio optimization model

It is assumed in the standard portfolio analysis that an investor is risk averse and that his utility is a function of the mean and variance of the rate of the return of the portfolio or can be approximated as such. It turns out, however, that the third moment (skewness) plays an important role if the distribution of the rate of return of assets is asymmetric around the mean. In particular, an investor would prefer a portfolio with larger third moment if the mean and variance are the same. In this paper, we propose a practical scheme to obtain a portfolio with a large third moment under the constraints on the first and second moment. The problem we need to solve is a linear programming problem, so that a large scale model can be optimized without difficulty. It is demonstrated that this model generates a portfolio with a large third moment very quickly.Presently at Mitsubishi Trust Bank Co., Ltd.     

A compact optimization model for the tail assignment problem

This paper investigates a new model for the so-called Tail Assignment Problem, which consists in assigning a well-identified airplane to each flight leg of a given flight schedule, in order to minimize total cost (cost of operating the flights and possible maintenance costs) while complying with a number of operational constraints. The mathematical programming formulation proposed is compact (i.e., involves a number of $0?1$ decision variables and constraints polynomial in the problem size parameters) and is shown to be of significantly reduced dimension as compared with previously known compact models. Computational experiments on series of realistic problem instances (obtained by random sampling from real-world data set) are reported. It is shown that with the proposed model, current state-of-the art MIP solvers can efficiently solve to exact optimality large instances representing 30-day flight schedules with typically up to 40 airplanes and 1500 flight legs connecting as many as 21 airports. The model also includes the main existing types of maintenance constraints, and extensive computational experiments are reported on problem instances of size typical of practical applications.     

A class of possibilistic portfolio selection model with interval coefficients and its application

Because of the existence of non-stochastic factors in stock markets, several possibilistic portfolio selection models have been proposed, where the expected return rates of securities are considered as fuzzy variables with possibilistic distributions. This paper deals with a possibilistic portfolio selection model with interval center values. By using modality approach and goal attainment approach, it is converted into a nonlinear goal programming problem. Moreover, a genetic algorithm is designed to obtain a satisfactory solution to the possibilistic portfolio selection model under complicated constraints. Finally, a numerical example based on real world data is also provided to illustrate the effectiveness of the genetic algorithm.     

A general approach to Bayesian portfolio optimization

We develop a general approach to portfolio optimization taking account of estimation risk and stylized facts of empirical finance. This is done within a Bayesian framework. The approximation of the posterior distribution of the unknown model parameters is based on a parallel tempering algorithm. The portfolio optimization is done using the first two moments of the predictive discrete asset return distribution. For illustration purposes we apply our method to empirical stock market data where daily asset log-returns are assumed to follow an orthogonal MGARCH process with t-distributed perturbations. Our results are compared with other portfolios suggested by popular optimization strategies.     

A maximum principle for relaxed stochastic control of linear SDEs with application to bond portfolio optimization

We study relaxed stochastic control problems where the state equation is a one dimensional linear stochastic differential equation with random and unbounded coefficients. The two main results are existence of an optimal relaxed control and necessary conditions for optimality in the form of a relaxed maximum principle. The main motivation is an optimal bond portfolio problem in a market where there exists a continuum of bonds and the portfolio weights are modeled as measure-valued processes on the set of times to maturity.     

A moment matching approach to log-normal portfolio optimization

We consider the problem where a manager aims to minimize the probability of his portfolio return falling below a threshold while keeping the expected return no worse than a target, under the assumption that stock returns are Log-Normally distributed. This assumption, common in the finance literature for daily and weekly returns, creates computational difficulties because the distribution of the portfolio return is difficult to estimate precisely. We approximate it with a single Log-Normal random variable using the Fenton–Wilkinson method and investigate an iterative, data-driven approximation to the problem. We propose a two-stage solution approach, where the first stage requires solving a classic mean-variance optimization model and the second step involves solving an unconstrained nonlinear problem with a smooth objective function. We suggest an iterative calibration method to improve the accuracy of the method and test its performance against a Generalized Pareto Distribution approximation. We also extend our results to the design of basket options.     

A stochastic programming approach to multicriteria portfolio optimization

We study a stochastic programming approach to multicriteria multi-period portfolio optimization problem. We use a Single Index Model to estimate the returns of stocks from a market-representative index and a random walk model to generate scenarios on the possible values of the index return. We consider expected return, Conditional Value at Risk and liquidity as our criteria. With stocks from Istanbul Stock Exchange, we make computational studies for the two and three-criteria cases. We demonstrate the tradeoffs between criteria and show that treating these criteria simultaneously yields meaningful efficient solutions. We provide insights based on our experiments.     

A clustering approach for scenario tree reduction: an application to a stochastic programming portfolio optimization problem

This paper deals with the problem of scenario tree reduction for stochastic programming problems. In particular, a reduction method based on cluster analysis is proposed and tested on a portfolio optimization problem. Extensive computational experiments were carried out to evaluate the performance of the proposed approach, both in terms of computational efficiency and efficacy. The analysis of the results shows that the clustering approach exhibits good performance also when compared with other reduction approaches.     

Tri-criterion inverse portfolio optimization with application to socially responsible mutual funds

We present a framework for inverse optimization in a Markowitz portfolio model that is extended to include a third criterion. The third criterion causes the traditional nondominated frontier to become a surface. Until recently, it had not been possible to compute such a surface. But by using a new method that is able to generate the nondominated surfaces of tri-criterion portfolio selection problems, we are able to compute via inverse optimization the implied risk tolerances of given funds that pursue an additional objective beyond risk and return. In applying this capability to a broad sample of conventional and socially responsible (SR) mutual funds, we find that there appears to be no significant evidence that social responsibility issues, after the screening stage, are further taken into account in the asset allocation process, which is a result that is likely to be different from what many SR investors would expect.     

Dynamic portfolio optimization with risk control for absolute deviation model

In this paper, we present a new multiperiod portfolio selection with maximum absolute deviation model. The investor is assumed to seek an investment strategy to maximize his/her terminal wealth and minimize the risk. One typical feature is that the absolute deviation is employed as risk measure instead of classical mean variance method. Furthermore, risk control is considered in every period for the new model. An analytical optimal strategy is obtained in a closed form via dynamic programming method. Algorithm with some examples is also presented to illustrate the application of this model.     

A chordal preconditioner for large-scale optimization

We propose an automatic preconditioning scheme for large sparse numerical optimization. The strategy is based on an examination of the sparsity pattern of the Hessian matrix: using a graph-theoretic heuristic, a block-diagonal approximation to the Hessian matrix is induced. The blocks are submatrices of the Hessian matrix; furthermore, each block is chordal. That is, under a positive definiteness assumption, the Cholesky factorization can be applied to each block without creating any new nonzeros (fill). Therefore the preconditioner is space efficient. We conduct a number of numerical experiments to determine the effectiveness of the preconditioner in the context of a linear conjugate-gradient algorithm for optimization.     

A stochastic programming approach for multi-period portfolio optimization

This paper extends previous work on the use of stochastic linear programming to solve life-cycle investment problems. We combine the feature of asset return predictability with practically relevant constraints arising in a life-cycle investment context. The objective is to maximize the expected utility of consumption over the lifetime and of bequest at the time of death of the investor. Asset returns and state variables follow a first-order vector auto-regression and the associated uncertainty is described by discrete scenario trees. To deal with the long time intervals involved in life-cycle problems we consider a few short-term decisions (to exploit any short-term return predictability), and incorporate a closed-form solution for the long, subsequent steady-state period to account for end effects.     

A robust optimization model for dynamic market with uncertain production cost

This article presents a robust optimization formulation for dealing with production cost uncertainty in an oligopolistic market scenario. It is not uncommon that players in the market face an equilibrium selling price but uncertain production costs. We show that, based on a nominal problem, the robust optimization formulation can be derived as a variational inequality with control and state variables. This convenient approach may be applied for computing optimal solutions efficiently, which help manufacturers dramatically and rapidly reform production and distribution schedules such that they can compete in the market successfully.     

A polynomial optimization approach to constant rebalanced portfolio selection

We address the multi-period portfolio optimization problem with the constant rebalancing strategy. This problem is formulated as a polynomial optimization problem (POP) by using a mean-variance criterion. In order to solve the POPs of high degree, we develop a cutting-plane algorithm based on semidefinite programming. Our algorithm can solve problems that can not be handled by any of known polynomial optimization solvers.     

A sequential predictor retraining algorithm and its application to market prediction

In many applications, there are a large number of predictors, designed manually or trained automatically, to predict the same outcome. Much research has been devoted to the design of algorithms that can effectively select/combine these predictors to generate a more accurate ensemble predictor. The collaborative training algorithms from attribute distributed learning provide batch-processing solutions for scenarios in which the individual predictors are heterogeneous, taking different inputs and employing different models. However, in some applications, for example financial market prediction, it is desirable to use an online approach. In this paper, an innovative online algorithm is proposed, stemming from the collaborative training algorithms developed for attribute distributed learning. It sequentially takes new observations, simultaneously adjusting the way that the individual predictors are combined, and provides feedback to the individual predictors for them to be retrained in order to achieve a better ensemble predictor in real time. The efficacy of this new algorithm is demonstrated by extensive simulations on both artificial and real data, and particularly for financial market data. A trading strategy constructed from the ensemble predictor shows strong performance when applied to financial market prediction.     

An improved estimation to make Markowitz’s portfolio optimization theory users friendly and estimation accurate with application on the US stock market investment

Using the Markowitz mean–variance portfolio optimization theory, researchers have shown that the traditional estimated return greatly overestimates the theoretical optimal return, especially when the dimension to sample size ratio p/n is large. Bai et al. (2009) propose a bootstrap-corrected estimator to correct the overestimation, but there is no closed form for their estimator. To circumvent this limitation, this paper derives explicit formulas for the estimator of the optimal portfolio return. We also prove that our proposed closed-form return estimator is consistent when n → ∞ and p/n → y ∈ (0, 1). Our simulation results show that our proposed estimators dramatically outperform traditional estimators for both the optimal return and its corresponding allocation under different values of p/n ratios and different inter-asset correlations ρ, especially when p/n is close to 1. We also find that our proposed estimators perform better than the bootstrap-corrected estimators for both the optimal return and its corresponding allocation. Another advantage of our improved estimation of returns is that we can also obtain an explicit formula for the standard deviation of the improved return estimate and it is smaller than that of the traditional estimate, especially when p/n is large. In addition, we illustrate the applicability of our proposed estimate on the US stock market investment.     

Composition of an efficient portfolio in the Bielecki and Pliska market model

We study the continuous time portfolio optimization model due to Bielecki and Pliska where the mean returns of individual securities or asset categories are explicitly affected by underlying economic factors. We introduce the functional Q _γ featuring the expected earnings yield of portfolio minus a penalty term proportional with a coefficient γ to the variance when we keep the value of the factor levels fixed. The coefficient γ plays the role of a risk-aversion parameter. We find the optimal trading positions that can be obtained as the solution to a maximization problem for Q _γ at any moment of time. The single-factor case is analyzed in more details. We present a simple asset allocation example featuring a Vasicek-type interest rate which affects a stock index and also serves as a second investment opportunity. Then we compare our results with the theory of Bielecki and Pliska where the authors employ the methods of the risk-sensitive control theory thereby using an infinite horizon objective featuring the long run expected growth rate, the asymptotic variance, and a risk-aversion parameter similar to γ.