Robust duality for generalized convex programming problems under data uncertainty

In this paper we present a robust duality theory for generalized convex programming problems in the face of data uncertainty within the framework of robust optimization. We establish robust strong duality for an uncertain nonlinear programming primal problem and its uncertain Lagrangian dual by showing strong duality between the deterministic counterparts: robust counterpart of the primal model and the optimistic counterpart of its dual problem. A robust strong duality theorem is given whenever the Lagrangian function is convex. We provide classes of uncertain non-convex programming problems for which robust strong duality holds under a constraint qualification. In particular, we show that robust strong duality is guaranteed for non-convex quadratic programming problems with a single quadratic constraint with the spectral norm uncertainty under a generalized Slater condition. Numerical examples are given to illustrate the nature of robust duality for uncertain nonlinear programming problems. We further show that robust duality continues to hold under a weakened convexity condition.     

Borch’s Theorem from the perspective of comonotonicity

This short note revisits the classical Theorem of Borch on the characterization of Pareto optimal risk exchange treaties under the expected utility paradigm. Our objective is to approach the optimal risk exchange problem by a new method, which is based on a Breeden–Litzenberger type integral representation formula for increasing convex functions and the theory of comonotonicity. Our method allows us to derive Borch’s characterization without using Kuhn–Tucker theory, and also without the need of assuming that all utility functions are continuously differentiable everywhere. We demonstrate that our approach can be used effectively to solve the Pareto optimal risk-sharing problem with a positivity constraint being imposed on the admissible allocations when the aggregate risk is positive.     

Robust optimal investment–reinsurance strategies for an insurer with multiple dependent risks

This paper considers a robust optimal investment and reinsurance problem with multiple dependent risks for an Ambiguity-Averse Insurer (AAI), who is uncertain about the model parameters. We assume that the surplus of the insurance company can be allocated to the financial market consisting of one risk-free asset and one risky asset whose price process satisfies square root factor process. Under the objective of maximizing the expected utility of the terminal surplus, by adopting the technique of stochastic control, closed-form expressions of the robust optimal strategy and the corresponding value function are derived. The verification theorem is also provided. Finally, by presenting some numerical examples, the impact of some parameters on the optimal strategy is illustrated and some economic explanations are also given. We find that the robust optimal reinsurance strategies under the generalized mean–variance premium are very different from that under the variance premium principle. In addition, ignoring model uncertainty risk will lead to significant utility loss for the AAI.     

Robust optimal investment and reinsurance problem for a general insurance company under Heston model

In this paper, we study a robust optimal investment and reinsurance problem for a general insurance company which contains an insurer and a reinsurer. Assume that the claim process described by a Brownian motion with drift, the insurer can purchase proportional reinsurance from the reinsurer. Both the insurer and the reinsurer can invest in a financial market consisting of one risk-free asset and one risky asset whose price process is described by the Heston model. Besides, the general insurance company’s manager will search for a robust optimal investment and reinsurance strategy, since the general insurance company faces model uncertainty and its manager is ambiguity-averse in our assumption. The optimal decision is to maximize the minimal expected exponential utility of the weighted sum of the insurer’s and the reinsurer’s surplus processes. By using techniques of stochastic control theory, we give sufficient conditions under which the closed-form expressions for the robust optimal investment and reinsurance strategies and the corresponding value function are obtained.     

Robust non-zero-sum stochastic differential reinsurance game

This paper considers the non-zero-sum stochastic differential game problem between two ambiguity-averse insurers (AAIs) who encounter model uncertainty and seek the optimal reinsurance decision under relative performance concerns. Each AAI manages her own risks by purchasing reinsurance with the objective of maximizing the expected utility of her relative terminal surplus with respect to that of her counterparty. The two AAIs’ decisions influence each other through the insurers’ relative performance concerns and the correlation between their surplus processes. We establish a general framework of Nash equilibrium for the associated non-zero-sum game with model uncertainty. For the representative case of exponential utilities, we solve the equilibrium strategies explicitly. Numerical studies are conducted to draw economic interpretations.     

基于不确定性期望效用模型的投资优化

针对资产的收益的分布不确切知道,并且所获得的矩信息也不是准确值的问题,提出了最大化最坏情形期望效用的鲁棒性方法.引入了凹凸类效用函数来度量模型不确定情形下投资者的效用,用一个不确定性结构来刻画资产收益的所有可能的分布和收益的矩信息,通过把具有不确定性结构的鲁棒性模型转化成参数二次规划问题,得到了最优投资策略、有效前沿和均衡价格的解析表示.方法为采用保守策略并且厌恶不确定性的投资者提供了一种有效的投资决策方案.     

Support vector machine classifiers with uncertain knowledge sets via robust optimization

In this article we study support vector machine (SVM) classifiers in the face of uncertain knowledge sets and show how data uncertainty in knowledge sets can be treated in SVM classification by employing robust optimization. We present knowledge-based SVM classifiers with uncertain knowledge sets using convex quadratic optimization duality. We show that the knowledge-based SVM, where prior knowledge is in the form of uncertain linear constraints, results in an uncertain convex optimization problem with a set containment constraint. Using a new extension of Farkas' lemma, we reformulate the robust counterpart of the uncertain convex optimization problem in the case of interval uncertainty as a convex quadratic optimization problem. We then reformulate the resulting convex optimization problems as a simple quadratic optimization problem with non-negativity constraints using the Lagrange duality. We obtain the solution of the converted problem by a fixed point iterative algorithm and establish the convergence of the algorithm. We finally present some preliminary results of our computational experiments of the method.     

Some characterizations of robust optimal solutions for uncertain convex optimization problems

In this paper, we consider robust optimal solutions for a convex optimization problem in the face of data uncertainty both in the objective and constraints. By using the properties of the subdifferential sum formulae, we first introduce a robust-type subdifferential constraint qualification, and then obtain some completely characterizations of the robust optimal solution of this uncertain convex optimization problem. We also investigate Wolfe type robust duality between the uncertain convex optimization problem and its uncertain dual problem by proving duality between the deterministic robust counterpart of the primal model and the optimistic counterpart of its dual problem. Moreover, we show that our results encompass as special cases some optimization problems considered in the recent literature.     

Robust Duality in Parametric Convex Optimization

Modelling of convex optimization in the face of data uncertainty often gives rise to families of parametric convex optimization problems. This motivates us to present, in this paper, a duality framework for a family of parametric convex optimization problems. By employing conjugate analysis, we present robust duality for the family of parametric problems by establishing strong duality between associated dual pair. We first show that robust duality holds whenever a constraint qualification holds. We then show that this constraint qualification is also necessary for robust duality in the sense that the constraint qualification holds if and only if robust duality holds for every linear perturbation of the objective function. As an application, we obtain a robust duality theorem for the best approximation problems with constraint data uncertainty under a strict feasibility condition.     

Optimal Consumption and Portfolio with Ambiguity to Markovian Switching

This paper considers the problem of maximizing expected utility from consumption and terminal wealth under model uncertainty for a general semimartingale market, where the agent with an initial capital and a random endowment can invest. To find a solution to the investment problem we use the martingale method. We first prove that under appropriate assumptions a unique solution to the investment problem exists. Then we deduce that the value functions of primal problem and dual problem are convex conjugate functions. Furthermore we consider a diffusion-jump-model where the coefficients depend on the state of a Markov chain and the investor is ambiguity to the intensity of the underlying Poisson process. Finally, for an agent with the logarithmic utility function, we use the stochastic control method to derive the Hamilton-Jacobi-Bellmann (HJB) equation. And the solution to this HJB equation can be determined numerically. We also show how thereby the optimal investment strategy can be computed.     

Approximate Optimality and Approximate Duality for Quasi Approximate Solutions in Robust Convex Semidefinite Programs

In this paper, we study quasi approximate solutions for a convex semidefinite programming problem in the face of data uncertainty. Using the robust optimization approach (worst-case approach), approximate optimality conditions and approximate duality theorems for quasi approximate solutions in robust convex semidefinite programming problems are explored under the robust characteristic cone constraint qualification. Moreover, some examples are given to illustrate the obtained results.     

Optimal insurance under the insurer’s risk constraint

In this paper, we impose the insurer’s risk constraint on Arrow’s optimal insurance model. The insured aims to maximize his/her expected utility of terminal wealth, under the constraint that the insurer wishes to control the expected loss of his/her terminal wealth below some prespecified level. We solve the problem, and it is shown that when the insurer’s risk constraint is binding, the solution to the problem is not linear, but piecewise linear deductible. Moreover, it can be shown that the insured’s optimal expected utility will increase if the insurer increases his/her risk tolerance.     

Robust reward–risk ratio optimization with application in allocation of generation asset

In this article, we study reward–risk ratio models under partially known message of random variables, which is called robust (worst-case) performance ratio problem. Based on the positive homogenous and concave/convex measures of reward and risk, respectively, the new robust ratio model is reduced equivalently to convex optimization problems with a min–max optimization framework. Under some specially partial distribution situation, the convex optimization problem is converted into simple framework involving the expectation reward measure and conditional value-at-risk measure. Compared with the existing reward–risk portfolio research, the proposed ratio model has two characteristics. First, the addressed problem combines with two different aspects. One is to consider an incomplete information case in real-life uncertainty. The other is to focus on the performance ratio optimization problem, which can realize the best balance between the reward and risk. Second, the complicated optimization model is transferred into a simple convex optimization problem by the optimal dual theorem. This indeed improves the usability of models. The generation asset allocation in power systems is presented to validate the new models.     

Robust conjugate duality for convex optimization under uncertainty with application to data classification

In this paper we present a robust conjugate duality theory for convex programming problems in the face of data uncertainty within the framework of robust optimization, extending the powerful conjugate duality technique. We first establish robust strong duality between an uncertain primal parameterized convex programming model problem and its uncertain conjugate dual by proving strong duality between the deterministic robust counterpart of the primal model and the optimistic counterpart of its dual problem under a regularity condition. This regularity condition is not only sufficient for robust duality but also necessary for it whenever robust duality holds for every linear perturbation of the objective function of the primal model problem. More importantly, we show that robust strong duality always holds for partially finite convex programming problems under scenario data uncertainty and that the optimistic counterpart of the dual is a tractable finite dimensional problem. As an application, we also derive a robust conjugate duality theorem for support vector machines which are a class of important convex optimization models for classifying two labelled data sets. The support vector machine has emerged as a powerful modelling tool for machine learning problems of data classification that arise in many areas of application in information and computer sciences.     

Optimal consumption-leisure, portfolio and retirement selection based on α-maxmin expected CES utility with ambiguity

This article studies optimal consumption-leisure, portfolio and retirement selection of an infinitely lived investor whose preference is formulated by ??-maxmin expected CES utility which is to differentiate ambiguity and ambiguity attitude. Adopting the recursive multiplepriors utility and the technique of backward stochastic differential equations (BSDEs), we transform the ??-maxmin expected CES utility into a classical expected CES utility under a new probability measure related to the degree of an investor??s uncertainty. Our model investigates the optimal consumption-leisure-work selection, the optimal portfolio selection, and the optimal stopping problem. In this model, the investor is able to adjust her supply of labor flexibly above a certain minimum work-hour along with a retirement option. The problem can be analytically solved by using a variational inequality. And the optimal retirement time is given as the first time when her wealth exceeds a certain critical level. The optimal consumption-leisure and portfolio strategies before and after retirement are provided in closed forms. Finally, the distinctions of optimal consumption-leisure, portfolio and critical wealth level under ambiguity from those with no vagueness are discussed.     

Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs

In this paper, we introduce a new dual program, which is representable as a semidefinite linear programming problem, for a primal convex minimax programming problem, and we show that there is no duality gap between the primal and the dual whenever the functions involved are sum-of-squares convex polynomials. Under a suitable constraint qualification, we derive strong duality results for this class of minimax problems. Consequently, we present applications of our results to robust sum-of-squares convex programming problems under data uncertainty and to minimax fractional programming problems with sum-of-squares convex polynomials. We obtain these results by first establishing sum-of-squares polynomial representations of non-negativity of a convex max function over a system of sum-of-squares convex constraints. The new class of sum-of-squares convex polynomials is an important subclass of convex polynomials and it includes convex quadratic functions and separable convex polynomials. The sum-of-squares convexity of polynomials can numerically be checked by solving semidefinite programming problems whereas numerically verifying convexity of polynomials is generally very hard.     

具有共同冲击相依性的跳扩散金融市场中有着延迟和违约风险的鲁棒最优再保险和投资策略

在本文中,我们考虑跳扩散模型下具有延迟和违约风险的鲁棒最优再保险和投资问题,保险人可以投资无风险资产,可违约的债券和两个风险资产,其中两个风险资产遵循跳跃扩散模型且受到同种因素带来共同影响而相互关联.假设允许保险人购买比例再保险,特别地再保险保费利用均值方差保费原则来计算.在考虑与绩效相关的资本流入/流出下,保险公司的财富过程通过随机微分延迟方程建模.保险公司的目标是最大程度地发挥终端财富和平均绩效财富组合的预期指数效用,以分别研究违约前和违约后的情况.此外,推导了最优策略的闭式表达式和相应的价值函数.最后通过数值算例和敏感性分析,表明了各种参数对最优策略的影响.另外对于模糊厌恶投资者,忽视模型模糊性风险会带来显著的效用损失.     

Robust equilibrium reinsurance-investment strategy for a mean–variance insurer in a model with jumps

This paper analyzes the equilibrium strategy of a robust optimal reinsurance-investment problem under the mean–variance criterion in a model with jumps for an ambiguity-averse insurer (AAI) who worries about model uncertainty. The AAI’s surplus process is assumed to follow the classical Cramér–Lundberg model, and the AAI is allowed to purchase proportional reinsurance or acquire new business and invest in a financial market to manage her risk. The financial market consists of a risk-free asset and a risky asset whose price process is described by a jump-diffusion model. By applying stochastic control theory, we establish the corresponding extended Hamilton–Jacobi–Bellman (HJB) system of equations. Furthermore, we derive both the robust equilibrium reinsurance-investment strategy and the corresponding equilibrium value function by solving the extended HJB system of equations. In addition, some special cases of our model are provided, which show that our model and results extend some existing ones in the literature. Finally, the economic implications of our findings are illustrated, and utility losses from ignoring model uncertainty, jump risks and prohibiting reinsurance are analyzed using numerical examples.     

On approximate solutions for robust convex semidefinite optimization problems

In this paper, we consider approximate solutions (\(\epsilon \)-solutions) for a convex semidefinite programming problem in the face of data uncertainty. Using robust optimization approach (worst-case approach), we prove an approximate optimality theorem and approximate duality theorems for \(\epsilon \)-solutions in robust convex semidefinite programming problem under the robust characteristic cone constraint qualification. Moreover, an example is given to illustrate the obtained results.     

凸概率密度分布簇下的多损失鲁棒优化等价模型及在直营连锁企业中的应用

首先,证明了凸概率密度分布簇的单周期期望均值下单损失鲁棒优化等价模型定理,以及凸概率密度分布簇的单周期期望均值下多损失鲁棒优化等价模型。然后,提出了直营连锁企业的产品在凸概率密度分布簇下的期望均值的单周期生产分配供应问题,建立了直营连锁企业的单周期生产分配供应期望均值鲁棒模型,在获得近似周期概率分布簇情形下给出了单周期生产分配供应鲁棒模型,这种近似鲁棒模型等价于一个线性规划问题。最后,通过已知一个产品的4个周期构成的混合分布簇进行了数值实验,数值结果表明了期望均值准则下的生产分配供应鲁棒模型的生产分配供应策略更加稳健。