A class of problems where dual bounds beat underestimation bounds

We investigate the problem of minimizing a nonconvex function with respect to convex constraints, and we study different techniques to compute a lower bound on the optimal value: The method of using convex envelope functions on one hand, and the method of exploiting nonconvex duality on the other hand. We investigate which technique gives the better bound and develop conditions under which the dual bound is strictly better than the convex envelope bound. As a byproduct, we derive some interesting results on nonconvex duality.     

A control approach to robust utility maximization with logarithmic utility and time-consistent penalties

We propose a stochastic control approach to the dynamic maximization of robust utility functionals that are defined in terms of logarithmic utility and a dynamically consistent convex risk measure. The underlying market is modeled by a diffusion process whose coefficients are driven by an external stochastic factor process. In particular, the market model is incomplete. Our main results give conditions on the minimal penalty function of the robust utility functional under which the value function of our problem can be identified with the unique classical solution of a quasilinear PDE within a class of functions satisfying certain growth conditions. The fact that we obtain classical solutions rather than viscosity solutions facilitates the use of numerical algorithms, whose applicability is demonstrated in examples.     

Ratios of affine functions

Aratio of affine functions is a function which can be expressed as the ratio of a vector valued affine function and a scalar affine functional. The purpose of this note is to examine properties of sets which are preserved under images and inverse images of such functions. Specifically, we show that images and inverse images of convex sets under such functions are convex sets. Also, images of bounded, convex polytopes under such functions are bounded, convex polytopes. In addition, we provide sufficient conditions under which the extreme points of images of convex sets are images of extreme points of the underlying domains. Of course, this result is useful when one wishes to maximize a convex function over a corresponding set. The above assertions are well known for affine functions. Applications of the results include a problem that concerns the control of stochastic eigenvectors of stochastic matrices.     

Convex Ordering for Random Vectors using Predictable Representation

We prove convex ordering results for random vectors admitting a predictable representation in terms of a Brownian motion and a non-necessarily independent jump component. Our method uses forward-backward stochastic calculus and extends the results proved in Klein et al. (Electron J Probab 11(20):27, 2006) in the one-dimensional case. We also study a geometric interpretation of convex ordering for discrete measures in connection with the conditions set on the jump heights and intensities of the considered processes. The work described in this paper was partially supported by a grant from City University of Hong Kong (Project No. 7200108).     

Structural results for partially observed control models

A general partially observed control model with discrete time parameter is investigated. Our main interest concerns monotonicity results and bounds for the value functions and for optimal policies. In particular, we show how the value functions depend on the observation kernels and we present conditions for a lower bound of an optimal policy. Our approach is based on two multivariate stochastic orderings: theTP ₂ ordering and the Blackwell ordering.Dedicated to Prof. Dr. K. Hinderer on the occassion of his 60^th birthday     

The convex envelope is the solution of a nonlinear obstacle problem

We derive a nonlinear partial differential equation for the convex envelope of a given function. The solution is interpreted as the value function of an optimal stochastic control problem. The equation is solved numerically using a convergent finite difference scheme.

     

An inverse optimal problem in discrete-time stochastic control

In this paper, we study an inverse optimal problem in discrete-time stochastic control. We give necessary and sufficient conditions for a solution to a system of stochastic difference equations to be the solution of a certain optimal control problem. Our results extend to the stochastic case the work of Dechert. In particular, we present a stochastic version of an important principle in welfare economics.     

A Deterministic Approach To Stochastic Optimal Control With Application To Anticipative Control

Using the decomposition of solution of SDE, we consider the stochastic optimal control problem with anticipative controls as a family of deterministic control problems parametrized by the paths of the driving Wiener process and of a newly introduced Lagrange multiplier stochastic process (nonanticipativity equality constraint). It is shown that the value function of these problems is the unique global solution of a robust equation (random partial differential equation) associated to a linear backward Hamilton-Jacobi-Bellman stochastic partial differential equation (HJB SPDE). This appears as limiting SPDE for a sequence of random HJB PDE's when linear interpolation approximation of the Wiener process is used. Our approach extends the Wong-Zakai type results [20] from SDE to the stochastic dynamic programming equation by showing how this arises as average of the limit of a sequence of deterministic dynamic programming equations. The stochastic characteristics method of Kunita [13] is used to represent the value function. By choosing the Lagrange multiplier equal to its nonanticipative constraint value the usual stochastic (nonanticipative) optimal control and optimal cost are recovered. This suggests a method for solving the anticipative control problems by almost sure deterministic optimal control. We obtain a PDE for the “cost of perfect information” the difference between the cost function of the nonanticipative control problem and the cost of the anticipative problem which satisfies a nonlinear backward HJB SPDE. Poisson bracket conditions are found ensuring this has a global solution. The cost of perfect information is shown to be zero when a Lagrangian submanifold is invariant for the stochastic characteristics. The LQG problem and a nonlinear anticipative control problem are considered as examples in this framework     

Sto chastic Maximum Principle for Optimal Control of Forward-backward Sto chastic Pantograph Systems with Regime Switching

In this paper, we derive the stochastic maximum principle for optimal control problems of the forward-backward Markovian regime-switching system. The control system is described by an anticipated forward-backward stochastic pantograph equation and modulated by a continuous-time finite-state Markov chain. By virtue of classical variational approach, duality method, and convex analysis, we obtain a stochastic maximum principle for the optimal control.     

Existence and sum decomposition of vertex polyhedral convex envelopes

Convex envelopes are a very useful tool in global optimization. However finding the exact convex envelope of a function is a difficult task in general. This task becomes considerably simpler in the case where the domain is a polyhedron and the convex envelope is vertex polyhedral, i.e., has a polyhedral epigraph whose vertices correspond to the vertices of the domain. A further simplification is possible when the convex envelope is sum decomposable, i.e., the convex envelope of a sum of functions coincides with the sum of the convex envelopes of the summands. In this paper we provide characterizations and sufficient conditions for the existence of a vertex polyhedral convex envelope. Our results extend and unify several results previously obtained for special cases of this problem. We then characterize sum decomposability of vertex polyhedral convex envelopes, and we show, among else, that the vertex polyhedral convex envelope of a sum of functions coincides with the sum of the vertex polyhedral convex envelopes of the summands if and only if the latter sum is vertex polyhedral.     

L\'evy过程驱动的正倒向随机系统的随机最大值原理

研究了由Teugels鞅和与之独立的多维Brown运动共同驱动的正倒向随机控制系统的最优控制问题. 这里Teugels鞅是一列与L\'{e}vy 过程相关的两两强正交的正态鞅 (见Nualart, Schoutens 在2000年的结果). 在允许控制值域为一非空凸闭集假设下, 采用凸变分法和对偶技术获得了最优控制存在所满足的充分和必要条件. 作为应用, 系统研究了线性正倒向随机系统的二次最优控制问题(简记为FBLQ问题), 通过相应的随机哈密顿系统对最优控制 进行了对偶刻画. 这里的随机哈密顿系统是由Teugels鞅和多维Brown运动共同驱动的线性正倒向随机微分方程, 其由状态方程、伴随方程和最优控制的对偶表示共同来构成.     

A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming

This paper presents a new and high performance solution method for multistage stochastic convex programming. Stochastic programming is a quantitative tool developed in the field of optimization to cope with the problem of decision-making under uncertainty. Among others, stochastic programming has found many applications in finance, such as asset-liability and bond-portfolio management. However, many stochastic programming applications still remain computationally intractable because of their overwhelming dimensionality. In this paper we propose a new decomposition algorithm for multistage stochastic programming with a convex objective and stochastic recourse matrices, based on the path-following interior point method combined with the homogeneous self-dual embedding technique. Our preliminary numerical experiments show that this approach is very promising in many ways for solving generic multistage stochastic programming, including its superiority in terms of numerical efficiency, as well as the flexibility in testing and analyzing the model.Research supported by Hong Kong RGC Earmarked Grant CUHK4233/01E.     

Optimal variational principle for backward stochastic control systems associated with Lévy processes

The paper is concerned with optimal control of backward stochastic differential equation (BSDE) driven by Teugel’s martingales and an independent multi-dimensional Brownian motion,where Teugel’s martin- gales are a family of pairwise strongly orthonormal martingales associated with Lévy processes (see e.g.,Nualart and Schoutens’ paper in 2000).We derive the necessary and sufficient conditions for the existence of the op- timal control by means of convex variation methods and duality techniques.As an application,the optimal control problem of linear backward stochastic differential equation with a quadratic cost criteria (or backward linear-quadratic problem,or BLQ problem for short) is discussed and characterized by a stochastic Hamilton system.     

Optimal payout policy in presence of downside risk

We analyze the determination of a value maximizing dividend payout policy for a broad class of cash reserve processes modeled as spectrally negative jump diffusions. We extend previous results based on continuous diffusion models and characterize the value of the optimal dividend distribution strategy explicitly. We also characterize explicitly the values as well as the optimal dividend thresholds for a class of associated optimal liquidation and sequential lump sum dividend control problems. Our results indicate that both the value as well as the marginal value of the optimal policies are increasing functions of policy flexibility in the discontinuous setting as well.      

Stochastic comparisons of multivariate mixture models

In this paper we consider sufficient conditions in order to stochastically compare random vectors of multivariate mixture models. In particular we consider stochastic and convex orders, the likelihood ratio order, and the hazard rate and mean residual life dynamic orders. Applications to proportional hazard models and mixture models in risk theory are also given.     

On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables

In this paper, we propose a decomposition-based branch-and-bound (DBAB) algorithm for solving two-stage stochastic programs having mixed-integer first- and second-stage variables. A modified Benders' decomposition method is developed, where the Benders' subproblems define lower bounding second-stage value functions of the first-stage variables that are derived by constructing a certain partial convex hull representation of the two-stage solution space. This partial convex hull is sequentially generated using a convexification scheme such as the Reformulation-Linearization Technique (RLT) or lift-and-project process, which yields valid inequalities that are reusable in the subsequent subproblems by updating the values of the first-stage variables. A branch-and-bound algorithm is designed based on a hyperrectangular partitioning process, using the established property that any resulting lower bounding Benders' master problem defined over a hyperrectangle yields the same objective value as the original stochastic program over that region if the first-stage variable solution is an extreme point of the defining hyperrectangle or the second-stage solution satisfies the binary restrictions. We prove that this algorithm converges to a global optimal solution. Some numerical examples and computational results are presented to demonstrate the efficacy of this approach.     

A stochastic portfolio optimization model with complete memory

In this article, we consider a portfolio optimization problem of the Merton’s type with complete memory over a finite time horizon. The problem is formulated as a stochastic control problem on a finite time horizon and the state evolves according to a process governed by a stochastic process with memory. The goal is to choose investment and consumption controls such that the total expected discounted utility is maximized. Under certain conditions, we derive the explicit solutions for the associated Hamilton–Jacobi–Bellman (HJB) equations in a finite-dimensional space for exponential, logarithmic, and power utility functions. For those utility functions, verification results are established to ensure that the solutions are equal to the value functions, and the optimal controls are also derived.     

Dynamic convex duality in constrained utility maximization

ABSTRACT

In this paper, we study a constrained utility maximization problem following the convex duality approach. After formulating the primal and dual problems, we construct the necessary and sufficient conditions for both the primal and dual problems in terms of forward and backward stochastic differential equations (FBSDEs) plus some additional conditions. Such formulation then allows us to explicitly characterize the primal optimal control as a function of the adjoint process coming from the dual FBSDEs in a dynamic fashion and vice versa. We also find that the optimal wealth process coincides with the adjoint process of the dual problem and vice versa. Finally we solve three constrained utility maximization problems, which contrasts the simplicity of the duality approach we propose and the technical complexity of solving the primal problem directly.     

最优投资组合模型研究

本文研究了在完备金融市场上 ,投资者最优投资组合的随机模型。在模型参数为常系数 ,效用函数为 (0 ,T],B[0 ,T])上的有界可测函数的情形下 ,得出其最大效用值函数是随机控制问题对应的 HJB方程的平滑解 ;最优策略被证明是存在的 ,并用反馈形式给出了最优投资组合策略。