Transaction cost was an important factor in the financial *** to the situation of the underdeveloped market,we proposed a mean-variance portfolio selection model with nonsmooth concave transaction *** is nonsmooth pro...
详细信息
Transaction cost was an important factor in the financial *** to the situation of the underdeveloped market,we proposed a mean-variance portfolio selection model with nonsmooth concave transaction *** is nonsmooth programming *** paper proposed the subsection method and pivoting algorithm to solve it,and proved these algorithms ***,according to annual yields of six kinds of securities in eight years,we solved the mean-variance portfolio optimal strategy with nonsmooth concave transaction *** example was given to illustrate the efficiency of the algorithms,which offered a new way to solve the problems of nonsmooth programming.
Portfolio optimization is an important branch to which optimization methods are applied. Transaction costs have significant influence on portfolio rebalancing in practice. The introduction of transaction costs into op...
详细信息
ISBN:
(纸本)9780769536453
Portfolio optimization is an important branch to which optimization methods are applied. Transaction costs have significant influence on portfolio rebalancing in practice. The introduction of transaction costs into optimal rebalancing model significantly enlarges the size of optimization problem and need more efficient algorithms. We deduce the relationships between the Karush-Kuhn-Tucker (KKT) conditions of the original model and those of its sub-problem. pivoting algorithm can make full use of these relationships to obtain the optimal solution for the original model efficiently from that for its subproblem.
Portfolio optimization is an important branch to which optimization methods are applied. Transaction costs have significant influence on portfolio rebalancing in practice. The introduction of transaction costs into op...
详细信息
Portfolio optimization is an important branch to which optimization methods are applied. Transaction costs have significant influence on portfolio rebalancing in practice. The introduction of transaction costs into optimal rebalancing model significantly enlarges the size of optimization problem and need more efficient algorithms. We deduce the relationships between the Karush-Kuhn-Tucker (KKT) conditions of the original model and those of its sub-problem. pivoting algorithm can make full use of these relationships to obtain the optimal solution for the original model efficiently from that for its subproblem.
In order to solve the "dimension curse" and higher-order nonlinear, the paper proposes the discrete approximate iteration, and uses it to solve the continuum dynamic programming. Firstly, according to the ne...
详细信息
ISBN:
(纸本)9783037853566
In order to solve the "dimension curse" and higher-order nonlinear, the paper proposes the discrete approximate iteration, and uses it to solve the continuum dynamic programming. Firstly, according to the network method, discretizes the state variables and transforms the model into multiperiod weighted digraph. Secondly, uses the max-plus algebra to solve the minimal path that is the admissible solution. At last, based on the admissible solution, we continues iterating until the two admissible solution is near. The paper also proves the convergence of the method.
A new expected utility (EU) portfolio selection model is proposed under the assumption that the trading volume has the box constraints. In the model, the expected utility function is quadratic. The model is solved by ...
详细信息
ISBN:
(纸本)9783642214103
A new expected utility (EU) portfolio selection model is proposed under the assumption that the trading volume has the box constraints. In the model, the expected utility function is quadratic. The model is solved by a pivoting algorithm which needn't be added any slack, surplus and artificial variable, and is easy to operate and works efficiently. A numerical example of a portfolio selection problem is given to compare the new model and the EU portfolio selection model not considering upper bounds. The comparison shows that when the risk preference coefficient is greater than a critical value, the risk and expected return don't increase as the coefficient increases;The relationship between the risk preference coefficient and the expected return (or risk) is nonlinear while that is linear in the case when short sales are allowed;the efficient portfolio selection considering the box constraints is subset of that not considering the constraints.
A new expected utility (EU) portfolio selection model without short sales is proposed. In the model, the expected utility function is quadratic. The model is solved by the pivoting algorithm. The paper showed in the E...
详细信息
ISBN:
(纸本)9783037851036
A new expected utility (EU) portfolio selection model without short sales is proposed. In the model, the expected utility function is quadratic. The model is solved by the pivoting algorithm. The paper showed in the EU portfolio selection model without the short sales, the relationship between the risk preference coefficient and the expected return is not linear but more complex. The risk preference coefficient could just reflect the investors' preference in some intervals. We wrote program to calculate the optimal portfolios with the different coefficient. Investors could choose the optimal investment strategy according to both their own risk preference and the expected return of the portfolio.
This paper presents a pivoting-based method for solving convex quadratic programming and then shows how to use it together with a parameter technique to solve mean-variance portfolio selection problems.
This paper presents a pivoting-based method for solving convex quadratic programming and then shows how to use it together with a parameter technique to solve mean-variance portfolio selection problems.
We study the behavior of simple principal pivoting methods for the P-matrix linear complementarity problem (P-LCP). We solve an open problem of Morris by showing that Murty's least-index pivot rule (under any fixe...
详细信息
We study the behavior of simple principal pivoting methods for the P-matrix linear complementarity problem (P-LCP). We solve an open problem of Morris by showing that Murty's least-index pivot rule (under any fixed index order) leads to a quadratic number of iterations on Morris's highly cyclic P-LCP examples. We then show that on K-matrix LCP instances, all pivot rules require only a linear number of iterations. As the main tool, we employ unique-sink orientations of cubes, a useful combinatorial abstraction of the P-LCP.
There are many applications related to linearly constrained quadratic programs subjected to upper and lower bounds. Lower bounds and upper bounds are treated as different constraints by common quadratic programming al...
详细信息
ISBN:
(纸本)9780769535562
There are many applications related to linearly constrained quadratic programs subjected to upper and lower bounds. Lower bounds and upper bounds are treated as different constraints by common quadratic programming algorithms. These traditional treatments significantly increase the computation of quadratic programming problems. We employ pivoting algorithm to solve quadratic programming models. The algorithm can convert the quadratic programming with upper and lower bounds into quadratic programming with upper or lower bounds equivalently by making full use of the Karush-Kuhn-Tucker (KKT) conditions of the problem and decrease the computation. The algorithm can further decrease calculation to obtain solution of quadratic programming problems by solving a smaller linear inequality system which is the linear part of KKT conditions for the quadratic programming problems and is equivalent to the KKT conditions while maintaining complementarity conditions of the KKT conditions to hold.
A parametric algorithm is proposed to calculate efficient frontier of long-short *** key to the algorithm is to introduce parametric technique into the pivoting *** numerical results show that the algorithm has high c...
详细信息
A parametric algorithm is proposed to calculate efficient frontier of long-short *** key to the algorithm is to introduce parametric technique into the pivoting *** numerical results show that the algorithm has high computing efficiency.
暂无评论