【作者】 戴志锋；

【导师】 李董辉；

【作者基本信息】 湖南大学 ， 计算数学， 2013， 博士

【摘要】 非线性共轭梯度法是求解大规模最优化问题深受欢迎的一类算法,也是倍受学者们关注的一类算法.非线性共轭梯度法的研究近年来又有了许多新的进展.本文进一步研究求解无约束最优化问题的非线性共轭梯度法.结合共轭梯度法和投影梯度法,提出一种求解线性等式约束优化问题的共轭梯度型方法,并将该方法应用于投资组合问题.本文还进一步研究鲁棒最优投资组合问题.在第2章,基于Li和Fukushima的修正割线条件,我们提出两种修正Hestenes-Stiefel (HS)型共轭梯度法.两种方法的一个共同性质是算法能产生充分下降方向.不需要采用截断策略和目标函数为凸的假设,我们证明两种方法在标准Armijio线搜索下全局收敛.而且,在较弱的条件下,证明两种方法具有R-阶线性收敛速率.另外,我们给出一种适用的初始步长选取方式,并讨论初始步长在标准Armijio线搜索下的可接受性.数值试验表明该方法有很好的数值效果,可以和CG-DESCENT共轭梯度法相媲美.在第3章,我们将Rosen梯度投影法和修正的Fletcher-Reeves(FR)共轭梯度法相结合,提出一种求解带线性等式约束优化问题的共轭梯度型算法.该算法产生的搜索方向是可行下降方向.在较弱条件下,当采用Armijio线搜索时,该算法具有全局收敛性.我们还证明,当用于求解线性等式约束下二次函数极小值问题时,若采用精确线性搜索,则该算法具有有限终止性.最后,我们研究该算法在Markowitz均值-方差投资组合模型中的应用,数值试验表明该算法较Rosen梯度投影法更有效.在第4章,我们研究鲁棒均值下半绝对偏差投资组合模型.假定资产收益的期望属于矩形和椭球不确定集,分别给出矩形不确定集下和椭球不确定集下鲁棒均值下半绝对偏差投资组合优化模型,其中前者可转化为线性规划(LP)问题,后者可转化为二阶锥规划(SOCP)问题.采用上海交易市场上证50的实际交易数据对所提出的模型进行实证分析,结果表明鲁棒均值下半绝对偏差投资组合优化模型能够获得具有更好财富增长率的投资策略,及更稳定的回报.Conine(?)Tamarkin以及Andrew和Chen指出金融资产的收益具有非对称的性质,尤其是保险和信用风险资产.已有的鲁棒条件风险模型基本是基于矩形或椭球等对称的不确定集,因此用矩形或椭球等对称的不确定集刻画资产信息的偏差,是导致鲁棒模型过于保守的可能原因之一.在第5章,基于Chen等的鲁棒优化技术,假定投资组合收益的均值属于非对称仿射不确定集,我们提出一种计算上可解的鲁棒条件风险投资组合模型.新方法的突出优点是鲁棒模型保持原问题的计算复杂度,即鲁棒模型仍然是一个线性规划问题,而且该鲁棒模型考虑了资产回报的非对称性.通过模拟数据和市场数据的数值试验,表明新鲁棒优化模型的有效性.条件风险价值(CVaR)因其是一致性风险度量和数学上的凸性,是目前最重要的风险度量方法.然而,近期的研究表明抽样样本的误差对条件价值风险(CVaR)的实际应用产生很大的影响,其原因是条件风险价值(CVaR)的计算依赖于小部分大损失的样本.在第6章,我们提出一种考虑抽样样本的误差的Worst-Case条件价值风险(称之为AWCVaR)我们证明AWCVaR是一个一致性风险度量,并且其鲁棒对应形式仍然是一个线性规划问题.实证分析表明AWCVaR较CVaR更有效.更多还原

【Abstract】 Nonlinear conjugate gradient methods form a class of welcome methods forsolving large-scale unconstrained optimization problem. In recent years, there hasbeen much new progress in nonlinear conjugate gradient methods. This thesisfurther studies nonlinear conjugate gradient methods. Combined with the con-jugate gradient method and projection gradient method, we propose a conjugategradient-type method for solving linear equality constrained optimization prob-lem, and apply it to portfolio problem. Finally we further study robust optimalportfolio problem.In Chapter2, based on the modified secant equation by Li and Fukushima,we propose two modified Hestenes-Stiefel (HS) conjugate gradient methods. Acommon nice property of the proposed methods is that they can generate sufcientdescent directions without any line search. Under mild conditions, we show that themethods with Armijio line search are globally convergent. Moreover, the R-linearconvergence rate of the modified HS methods is established. Preliminary numericalresults show that the proposed methods are promising, and are competitive withthe well-known CG-DESCENT method.In Chapter3, combining the idea of the modified Fletcher-Reeves conjugategradient method and the Rosen gradient projection method, we propose a conju-gate gradient-type method for linear equality constrained optimization problem.Search direction generated by the method is a feasible descent direction. Con-sequently the generated iterates are feasible points, moreover, the sequence offunction is decreasing. Under mild conditions, we show that the method withArmijio line search is globally convergent. Moreover, when the method with exactline search is used to solve a linear equality constrained quadratic programming,it will terminate at the solution of the problem within finite iterations We applythe proposed method to Markowitz mean-variance portfolio optimization problem.Numerical results show that the method is more efective than the Rosen gradientprojection method.In Chapter4, we study robust mean semi-absolute deviation models for port-folio optimization. We consider the case where the return of assets belongs to abox uncertainty set or ellipsoidal uncertainty set. We derive robust counterpartsfor both portfolio optimization. The first model is a Linear programming (LP) andthe last one is a second-order cone programming (SOCP), both can be computed efciently. The empirical analysis and comparisons from the real market data indi-cate that the robust models can obtain a portfolio strategy with the better wealthgrowth rate and more stable return.Andrew and Chen, Conine and Tamarkin found that the asymmetries in thedata reject the null hypothesis of multivariate normal distributions. Exiting robustCVaR method is under the box uncertainty set or the ellipsoidal uncertainty setwhich are symmetric. This may be overly conservative for capturing the deviationsof the asymmetric asset returns. In Chapter5, based on the robust optimizationtechniques by Chen et al, we study robust CVaR method in which the mean re-turn of the portfolio belongs a non-symmetric afne uncertainty set. We derive acomputationally tractable robust optimization method for minimizing the CVaRof a portfolio. A remarkable characteristic of the new method is that the robustoptimization model reserves the complexity of original portfolio optimization prob-lem, i.e., the robust counterpart problem is still a linear programming problem.Moreover, it takes into consideration asymmetries in the distributions of returns.We present some numerical experiments with simulated and real market data toillustrate the behavior of the robust optimization model.Conditional value-at-risk (CVaR) has become the most popular risk measuredue to its coherence property and tractability. However, recent study has indicatedthat optimal solutions to the CVaR minimization are highly susceptible to estima-tion error of the risk measure because the estimate depends on only a small portionof sampled scenarios. In Chapter6, considering the error of samples in conditionalvalue-at-risk (CVaR), we propose a Worst-Case CVaR risk (called AWCVaR). Weshow that the AWCVaR is a coherent risk measure, and the robust problem is stilla linear programming problem. The empirical analysis shows that AWCVaR ismore efective than the conditional value-at-risk (CVaR).更多还原