Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints

We will propose a branch and bound algorithm for calculating a globally optimal solution of a portfolio construction/rebalancing problem under concave transaction costs and minimal transaction unit constraints. We will employ the absolute deviation of the rate of return of the portfolio as the measure of risk and solve linear programming subproblems by introducing (piecewise) linear underestimating function for concave transaction cost functions. It will be shown by a series of numerical experiments that the algorithm can solve the problem of practical size in an efficient manner. Received: July 15, 1999 / Accepted: October 1, 2000?Published online December 15, 2000     

On consistency of stochastic dominance and mean–semideviation models

We analyze relations between two methods frequently used for modeling the choice among uncertain outcomes: stochastic dominance and mean–risk approaches. New necessary conditions for stochastic dominance are developed. These conditions compare values of a certain functional, which contains two components: the expected value of a random outcome and a risk term represented by the central semideviation of the corresponding degree. If the weight of the semideviation in the composite objective does not exceed the weight of the expected value, maximization of such a functional yields solutions which are efficient in terms of stochastic dominance. The results are illustrated graphically. Received: September 15, 1998 / Accepted: October 1, 2000?Published online December 15, 2000     

On the core of ordered submodular cost games

A general ordertheoretic linear programming model for the study of matroid-type greedy algorithms is introduced. The primal restrictions are given by so-called weakly increasing submodular functions on antichains. The LP-dual is solved by a Monge-type greedy algorithm. The model offers a direct combinatorial explanation for many integrality results in discrete optimization. In particular, the submodular intersection theorem of Edmonds and Giles is seen to extend to the case with a rooted forest as underlying structure. The core of associated polyhedra is introduced and applications to the existence of the core in cooperative game theory are discussed. Received: November 2, 1995 / Accepted: September 15, 1999?Published online February 23, 2000     

On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating

In previous work, the authors provided a foundation for the theory of variable metric proximal point algorithms in Hilbert space. In that work conditions are developed for global, linear, and super–linear convergence. This paper focuses attention on two matrix secant updating strategies for the finite dimensional case. These are the Broyden and BFGS updates. The BFGS update is considered for application in the symmetric case, e.g., convex programming applications, while the Broyden update can be applied to general monotone operators. Subject to the linear convergence of the iterates and a quadratic growth condition on the inverse of the operator at the solution, super–linear convergence of the iterates is established for both updates. These results are applied to show that the Chen–Fukushima variable metric proximal point algorithm is super–linearly convergent when implemented with the BFGS update. Received: September 12, 1996 / Accepted: January 7, 2000?Published online March 15, 2000     

Optimality conditions for nonconvex semidefinite programming

This paper concerns nonlinear semidefinite programming problems for which no convexity assumptions can be made. We derive first- and second-order optimality conditions analogous to those for nonlinear programming. Using techniques similar to those used in nonlinear programming, we extend existing theory to cover situations where the constraint matrix is structurally sparse. The discussion covers the case when strict complementarity does not hold. The regularity conditions used are consistent with those of nonlinear programming in the sense that the conventional optimality conditions for nonlinear programming are obtained when the constraint matrix is diagonal. Received: May 15, 1998 / Accepted: April 12, 2000?Published online May 12, 2000     

Duality and martingales: a stochastic programming perspective on contingent claims

The hedging of contingent claims in the discrete time, discrete state case is analyzed from the perspective of modeling the hedging problem as a stochastic program. Application of conjugate duality leads to the arbitrage pricing theorems of financial mathematics, namely the equivalence of absence of arbitrage and the existence of a probability measure that makes the price process into a martingale. The model easily extends to the analysis of options pricing when modeling risk management concerns and the impact of spreads and margin requirements for writers of contingent claims. However, we find that arbitrage pricing in incomplete markets fails to model incentives to buy or sell options. An extension of the model to incorporate pre-existing liabilities and endowments reveals the reasons why buyers and sellers trade in options. The model also indicates the importance of financial equilibrium analysis for the understanding of options prices in incomplete markets. Received: June 5, 2000 / Accepted: July 12, 2001?Published online December 6, 2001     

Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods

The paper extends prior work by the authors on loqo, an interior point algorithm for nonconvex nonlinear programming. The specific topics covered include primal versus dual orderings and higher order methods, which attempt to use each factorization of the Hessian matrix more than once to improve computational efficiency. Results show that unlike linear and convex quadratic programming, higher order corrections to the central trajectory are not useful for nonconvex nonlinear programming, but that a variant of Mehrotra’s predictor-corrector algorithm can definitely improve performance. Received: May 3, 1999 / Accepted: January 24, 2000?Published online March 15, 2000     

Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications

We obtain local estimates of the distance to a set defined by equality constraints under assumptions which are weaker than those previously used in the literature. Specifically, we assume that the constraints mapping has a Lipschitzian derivative, and satisfies a certain 2-regularity condition at the point under consideration. This setting directly subsumes the classical regular case and the twice differentiable 2-regular case, for which error bounds are known, but it is significantly richer than either of these two cases. When applied to a certain equation-based reformulation of the nonlinear complementarity problem, our results yield an error bound under an assumption more general than b-regularity. The latter appears to be the weakest assumption under which a local error bound for complementarity problems was previously available. We also discuss an application of our results to the convergence rate analysis of the exterior penalty method for solving irregular problems. Received: February 2000 / Accepted: November 2000?Published online January 17, 2001     

Existence of optimal solutions and duality results under weak conditions

In this paper we consider an ordinary convex program with no qualification conditions (such as Slater’s condition) and for which the optimal set is neither required to be compact, nor to be equal to the sum of a compact set and a linear space. It is supposed only that the infimum α is finite. A very wide class of convex functions is exhibited for which the optimum is always attained and α is equal to the supremum of the ordinary dual program. Additional results concerning the existence of optimal solutions in the non convex case are also given. Received: February 1, 1999 / Accepted: December 15, 1999?Published online February 23, 2000     

Portfolio selection with a minimax measure in safety constraint

In this paper, we attempt to design a portfolio optimization model for investors who desire to minimize the variation around the mean return and at the same time wish to achieve better return than the worst possible return realization at every time point in a single period portfolio investment. The portfolio is to be selected from the risky assets in the equity market. Since the minimax portfolio optimization model provides us with the portfolio that maximizes (minimizes) the worst return (worst loss) realization in the investment horizon period, in order to safeguard the interest of investors, the optimal value of the minimax optimization model is used to design a constraint in the mean-absolute semideviation model. This constraint can be viewed as a safety strategy adopted by an investor. Thus, our proposed bi-objective linear programming model involves mean return as a reward and mean-absolute semideviation as a risk in the objective function and minimax as a safety constraint, which enables a trade off between return and risk with a fixed safety value. The efficient frontier of the model is generated using the augmented -constraint method on the GAMS software. We simultaneously solve the ratio optimization problem which maximizes the ratio of mean return over mean-absolute semideviation with same minimax value in the safety constraint. Subsequently, we choose two portfolios on the above generated efficient frontier such that the risk from one of them is less and the mean return from other portfolio is more than the respective quantities of the optimal portfolio from the ratio optimization model. Extensive computational results and in-sample and out-of-sample analysis are provided to compare the financial performance of the optimal portfolios selected by our proposed model with that of the optimal portfolios from the existing minimax and mean-absolute semideviation portfolio optimization models on real data from S&P CNX Nifty index.     

一种基于区间数的证券组合投资模型与求解

提出了区间数的相对左偏度的定义.利用区间数的相对左偏度作为区间数下表达证券风险损失率的一种补充,能合理地反映风险损失率与预期收益率之间的相关关系.建立了一种新的证券组合投资区间数规划模型,将区间数规划模型转化为参数线性规划问题求解,使证券组合投资决策分析更加具有柔性.最后通过实例分析了该模型的应用价值.     

Credit risk optimization with Conditional Value-at-Risk criterion

This paper examines a new approach for credit risk optimization. The model is based on the Conditional Value-at-Risk (CVaR) risk measure, the expected loss exceeding Value-at-Risk. CVaR is also known as Mean Excess, Mean Shortfall, or Tail VaR. This model can simultaneously adjust all positions in a portfolio of financial instruments in order to minimize CVaR subject to trading and return constraints. The credit risk distribution is generated by Monte Carlo simulations and the optimization problem is solved effectively by linear programming. The algorithm is very efficient; it can handle hundreds of instruments and thousands of scenarios in reasonable computer time. The approach is demonstrated with a portfolio of emerging market bonds. Received: November 1, 1999 / Accepted: October 1, 2000?Published online December 15, 2000     

A note on Faigle and Kern’s dual greedy polyhedra

U. Faigle and W. Kern have recently extended the work of their earlier paper and of M. Queyranne, F. Spieksma and F. Tardella and have shown that a dual greedy algorithm works for a system of linear inequalities with {:0,1}-coefficients defined in terms of antichains of an underlying poset and a submodular function on the set of ideals of the poset under some additional condition on the submodular function.?In this note we show that Faigle and Kern’s dual greedy polyhedra belong to a class of submodular flow polyhedra, i.e., Faigle and Kern’s problem is a special case of the submodular flow problem that can easily be solved by their greedy algorithm. Received: February 1999 / Accepted: December 1999?Published online February 23, 2000     

基于Heston随机波动率模型和风险偏好视角的资产负债管理

本文研究基于Heston随机波动率模型的资产负债管理问题。假设金融市场由一个无风险资产和一个风险资产构成,投资者的目标是最大化其终端财富的期望效用。应用随机控制方法,得到了该问题最优资产配置策略的解析表达式和相应值函数的解析解,通过数值算例分析了Heston模型主要参数以及债务对最优资产配置策略的影响。结果表明:配置到风险资产的比例对Heston模型中的参数非常敏感;为了对冲债务风险,负债的引入使得配置到风险资产的比例比无负债情形下的高;在风险厌恶系数变大时,无论投资者是否有负债,其投资到风险资产的比例则越来越低。     

An expected regret minimization portfolio selection model

Fuzzy portfolio selection has been widely studied within the framework of the credibility theory. However, all existing models provide only concentrated investment solutions, which contradicts the risk diversification concept in the classical portfolio selection theory. In this paper, we propose an expected regret minimization model, which minimizes the expected value of the distance between the maximum return and the obtained return associated with each portfolio. We prove that our model is advantageous for obtaining distributive investment and reducing investor regret. The effectiveness of the model is demonstrated by using an example of a portfolio selection problem comprising ten securities in the Shanghai Stock Exchange 180 Index.     

Calculating risk neutral probabilities and optimal portfolio policies in a dynamic investment model with downside risk control

This paper presents a method for solving multiperiod investment models with downside risk control characterized by the portfolio’s worst outcome. The stochastic programming problem is decomposed into two subproblems: a nonlinear optimization model identifying the optimal terminal wealth distribution and a stochastic linear programming model replicating the identified optimal portfolio wealth. The replicating portfolio coincides with the optimal solution to the investor’s problem if the market is frictionless. The multiperiod stochastic linear programming model tests for the absence of arbitrage opportunities and its dual feasible solutions generate all risk neutral probability measures. When there are constraints such as liquidity or position requirements, the method yields approximate portfolio policies by minimizing the initial cost of the replication portfolio. A numerical example illustrates the difference between the replicating result and the optimal unconstrained portfolio.     

Model selection for regression on a fixed design

We deal with the problem of estimating some unknown regression function involved in a regression framework with deterministic design points. For this end, we consider some collection of finite dimensional linear spaces (models) and the least-squares estimator built on a data driven selected model among this collection. This data driven choice is performed via the minimization of some penalized model selection criterion that generalizes on Mallows' C _p . We provide non asymptotic risk bounds for the so-defined estimator from which we deduce adaptivity properties. Our results hold under mild moment conditions on the errors. The statement and the use of a new moment inequality for empirical processes is at the heart of the techniques involved in our approach. Received: 2 July 1997 / Revised version: 20 September 1999 / Published online: 6 July 2000     

Error bounds for infinite systems of convex inequalities without Slater’s condition

The feasible set of a convex semi–infinite program is described by a possibly infinite system of convex inequality constraints. We want to obtain an upper bound for the distance of a given point from this set in terms of a constant multiplied by the value of the maximally violated constraint function in this point. Apart from this Lipschitz case we also consider error bounds of H?lder type, where the value of the residual of the constraints is raised to a certain power.?We give sufficient conditions for the validity of such bounds. Our conditions do not require that the Slater condition is valid. For the definition of our conditions, we consider the projections on enlarged sets corresponding to relaxed constraints. We present a condition in terms of projection multipliers, a condition in terms of Slater points and a condition in terms of descent directions. For the Lipschitz case, we give five equivalent characterizations of the validity of a global error bound.?We extend previous results in two directions: First, we consider infinite systems of inequalities instead of finite systems. The second point is that we do not assume that the Slater condition holds which has been required in almost all earlier papers. Received: April 12, 1999 / Accepted: April 5, 2000?Published online July 20, 2000     

含有背景风险的双目标投资组合模型研究

投资者进行投资实践时无不面临着背景风险。绝大多数以均值方差为框架的投资组合并没有考虑背景风险,其效用在实际应用中容易受到背景风险的影响。本文在含有交易费用的双目标函数模型中引入背景风险,从是否含有背景风险和背景风险偏好度大小两方面对投资组合问题展开研究,并使用智能算法得到模型的最优解,对模型进行实证分析。实证结果表明:1)当背景风险收益为0时,含有背景风险的投资组合比不含有背景风险的投资组合更能反映真实的投资环境。2) 当背景风险收益不为0时,含有背景风险的投资组合比不含有背景风险的投资组合得到更高的收益。因此,考虑背景风险后投资组合的构建优于不考虑背景风险投资组合的构建。