On reduced convex QP formulations of monotone LCPs

Techniques for transforming convex quadratic programs (QPs) into monotone linear complementarity problems (LCPs) and vice versa are well known. We describe a class of LCPs for which a reduced QP formulation – one that has fewer constraints than the “standard” QP formulation – is available. We mention several instances of this class, including the known case in which the coefficient matrix in the LCP is symmetric. Received: May 2000 / Accepted: February 22, 2001?Published online April 12, 2001     

机构投资者的最优变现策略

在投资、变现等大宗交易过程中,资产交易价格与交易策略密切相关,因此,交易的完成过程需要很高的技巧.文章讨论了机构投资者的最优变现策略问题,假设证券价格服从几何布朗运动,以均值方差效用为目标函数,得到了最优变现策略所满足的二阶微分方程,并由差分法得到其数值解.最后,由参数的敏感性分析知:最优变现策略与瞬时冲击、市场波动率及风险厌恶系数等参数有关,但与永久冲击无关,且最优变现策略对市场波动率和瞬时冲击的变化较敏感.     

On approximate Monetary Unit Sampling

Monetary Unit Sampling (MUS), also known as Dollar-Unit Sampling, is a popular sampling strategy in Auditing, in which all units are to be randomly selected with probabilities proportional to the book value. However, if units sizes have very large variability, no vector of probabilities exists fulfilling the requirement that all probabilities are proportional to the associated book values. In this note we propose a Mathematical Optimization approach to address this issue. An optimization program is posed, structural properties of the optimal solution are analyzed, and an algorithm yielding the optimal solution in time and space linear to the number of population units is given.     

A new algorithm for generalized fractional programs

A new dual problem for convex generalized fractional programs with no duality gap is presented and it is shown how this dual problem can be efficiently solved using a parametric approach. The resulting algorithm can be seen as “dual” to the Dinkelbach-type algorithm for generalized fractional programs since it approximates the optimal objective value of the dual (primal) problem from below. Convergence results for this algorithm are derived and an easy condition to achieve superlinear convergence is also established. Moreover, under some additional assumptions the algorithm also recovers at the same time an optimal solution of the primal problem. We also consider a variant of this new algorithm, based on scaling the “dual” parametric function. The numerical results, in case of quadratic-linear ratios and linear constraints, show that the performance of the new algorithm and its scaled version is superior to that of the Dinkelbach-type algorithms. From the computational results it also appears that contrary to the primal approach, the “dual” approach is less influenced by scaling. This research was carried out at the Econometric Institute, Erasmus University, Rotterdam, the Netherlands and was supported by J.N.I.C.T. (Portugal) under contract BD/707/90-RM.     

A DIRECT METHOD IN OPTIMAL PORTFOLIO AND CONSUMPTION CHOICE

In this paper, we use a direct method to solve the optimal portfolio and consumption choice problem in the security market for a specific case, in which the utility function is of a given homogenous form, i.e. the so-called CRRA case. The idea comes from the completion technique ever used in LQ optimal control.     

Utility maximization in an illiquid market

We consider a stochastic optimization problem of maximizing the expected utility from terminal wealth in an illiquid market. A discrete time model is constructed with few additional state variables. The dynamic programming approach is then developed and used for numerical studies. No-arbitrage conditions were also discussed.     

限制投资下界的风险证券有效组合模型及算法研究

本文研究了具有投资下界限制的风险证券有限组合决策问题，提出了限制投资下界的风险证券有效组合优化模型，在一定的条件下，给出了风险证券有限组合投资比例的算法及解析表示，最后进行了实际数值计算，结果说明了所给算法是有效和实用的。     

PI(Portfolio Insurance)投资者特性研究

根据期权定价理论,分析了投资组合保险策略与期权的关系及投资组合保险策略与凸收益函数的关系,通过建立投资组合保险模型,得出不同条件下购买投资组合保险投资者的特点如下:1)随着财富的增加他们的风险承受能力比市场一般投资者增加的快;2)他们的市场预期比一般市场投资者更乐观,并且受益于投资组合保险.     

随机凸序与投资组合的风险值

本文利用随机凸序的理论证明了任意随机资产组合的风险不会超过其各个随机资产的风险值之和 ,即给出了投资组合的风险值上界 .指出了当投资者无法确定各随机资产的相依关系时 ,独立性假定会低投资组合的风险值 ;并分别针对正态资产、幂关系资产、指数资产给出了这种风险低估值的具体计算公式     

On First Order Optimality Conditions for Vector Optimization

We develop first order optimality conditions for constrained vector optimization. The partial orders for the objective and the constraints are induced by closed and convex cones with nonempty interior. After presenting some well known existence results for these problems, based on a scalarization approach, we establish necessity of the optimality conditions under a Slater-like constraint qualification, and then sufficiency for the K-convex case. We present two alternative sets of optimality conditions, with the same properties in connection with necessity and sufficiency, but which are different with respect to the dimension of the spaces to which the dual multipliers belong. We introduce a duality scheme, with a point-to-set dual objective, for which strong duality holds. Some examples and open problems for future research are also presented,     

半局部凸多目标半无限规划的最优性

研究半局部凸函数在多目标半无限规划下的最优性.利用半局部凸函数,讨论了在多目标半无限规划下的择一定理,最优性条件.使半局部凸函数运用的范围更加广泛.     

A note on convex cones and constraint qualifications in infinite-dimensional vector spaces

In connection with mathematical programming in infinite-dimensional vector spaces, Zowe has studied the relationship between the Slater constraint qualification and a formally weaker qualification used by Kurcyusz. The attractive feature of the latter is that it involves only active constraints. Zowe has proved that, in barreled spaces, the two qualifications are equivalent and has asked whether the assumption of barreledness is superfluous. By studying cores and interiors of convex cones, we show that the two constraint qualifications are equivalent in a given topological vector spaceE iff every barrel inE is a neighborhood of the origin. Thus, whenE is locally convex, the two constraint qualifications are equivalent iffE is barreled. Other questions of Zowe are also answered.This research was supported in part by the Office of Naval Research, and in part by the Sonderforschungsbereich 21, Institut für Operations Research, Bonn, Federal Republic of Germany. The author is indebted to Professor J. Zowe for some helpful comments.     

具指数赋权指标的证券投资多目标线性规划模型

本文提出证券投资决策的指数赋权指标体系．在该指标体系中,建立风险证券组合投资决策和存在无风险证券或无风险贷款时证券组合投资决策的多目标线性规划模型．研究了有效风险证券组合集和有效证券组合集的结构和相互关系,市场证券组合以及证券均衡市场价格和投资风险分析．     

股票市场涨跌停板设置的微模拟研究

本文构建了一个基于订单驱动的人工模拟股票市场模型,并对投资者在连续竞价交易时的投资行为进行了刻画,数值模拟所得的股票对数收益率序列具有尖峰、胖尾等非正态分布特征并显示出明显的波动率聚集现象。通过在模拟实验中设定股票价格的不同涨跌幅限制范围,研究了涨跌停板设置对股票市场波动性的影响,分析结果表明,在忽略诸如恶意操纵等其他因素情况下,适当扩大涨跌幅限制并不会使股票收益的波动增大,相反还会使收益的波动率有较为明显的降低。     

对称弧式连通凸多目标半无限规划的最优性

以弧式连通函数和对称梯度为基础,研究新函数在多目标半无限规划下的最优性理论.定义了一类新的弧式连通函数,对称弧式连通函数、对称拟弧式连通函数、对称弱拟弧式连通函数、对称伪弧式连通函数、对称严格伪弧式连通函数,讨论了这些函数在多目标半无限规划下的最优性.给出更加广义的弧式连通函数,将它们运用到多目标半无限规划.     

A direct approach to second order conditions for mixed equality constraints

In this paper we consider an optimal control problem posed over piecewise continuous controls and involving state-control (mixed) equality constraints. We provide an explicit derivation of second order necessary conditions simpler than others available in the literature, yielding a clear understanding of how to define a set of “differentially admissible variations” where a certain quadratic form is nonnegative.     

A Farkas lemma for difference sublinear systems and quasidifferentiable programming

A new generalized Farkas theorem of the alternative is presented for systems involving functions which can be expressed as the difference of sublinear functions. Various other forms of theorems of the alternative are also given using quasidifferential calculus. Comprehensive optimality conditions are then developed for broad classes of infinite dimensional quasidifferentiable programming problems. Applications to difference convex programming and infinitely constrained concave minimization problems are also discussed.