Deterministic Time-inconsistent Optimal Control Problems - an Essentially Cooperative Approach

A general deterministic time-inconsistent optimal control problem is formulated for ordinary differential equations. To find a time-consistent equilibrium value function and the corresponding time-consistent equilibrium control, a non-cooperative N-person differential game (but essentially cooperative in some sense) is introduced. Under certain conditions, it is proved that the open-loop Nash equilibrium value function of the N -person differential game converges to a time-consistent equilibrium value function of the original problem, which is the value function of a time-consistent optimal control problem. Moreover, it is proved that any optimal control of the time-consistent limit problem is a time-consistent equilibrium control of the original problem.     

Infinite-horizon deterministic dynamic programming in discrete time: a monotone convergence principle and a penalty method

We consider infinite-horizon deterministic dynamic programming problems in discrete time. We show that the value function of such a problem is always a fixed point of a modified version of the Bellman operator. We also show that value iteration converges increasingly to the value function if the initial function is dominated by the value function, is mapped upward by the modified Bellman operator and satisfies a transversality-like condition. These results require no assumption except for the general framework of infinite-horizon deterministic dynamic programming. As an application, we show that the value function can be approximated by computing the value function of an unconstrained version of the problem with the constraint replaced by a penalty function.     

Mordukhovich subgradients of the value function to a parametric discrete optimal control problem

This paper is devoted to the study of the first-order behavior of the value function of a parametric discrete optimal control problem with nonconvex cost functions and control constraints. By establishing an abstract result on the Mordukhovich subdifferential of the value function of a parametric mathematical programming problem, we derive a formula for computing the Mordukhovich subdifferential of the value function to a parametric discrete optimal control problem.     

Value-Estimation Function Method for Constrained Global Optimization

A novel value-estimation function method for global optimization problems with inequality constraints is proposed in this paper. The value-estimation function formulation is an auxiliary unconstrained optimization problem with a univariate parameter that represents an estimated optimal value of the objective function of the original optimization problem. A solution is optimal to the original problem if and only if it is also optimal to the auxiliary unconstrained optimization with the parameter set at the optimal objective value of the original problem, which turns out to be the unique root of a basic value-estimation function. A logarithmic-exponential value-estimation function formulation is further developed to acquire computational tractability and efficiency. The optimal objective value of the original problem as well as the optimal solution are sought iteratively by applying either a generalized Newton method or a bisection method to the logarithmic-exponential value-estimation function formulation. The convergence properties of the solution algorithms guarantee the identification of an approximate optimal solution of the original problem, up to any predetermined degree of accuracy, within a finite number of iterations.     

Exactness Property of the Exact Absolute Value Penalty Function Method for Solving Convex Nondifferentiable Interval-Valued Optimization Problems

In the paper, the classical exact absolute value function method is used for solving a nondifferentiable constrained interval-valued optimization problem with both inequality and equality constraints. The property of exactness of the penalization for the exact absolute value penalty function method is analyzed under assumption that the functions constituting the considered nondifferentiable constrained optimization problem with the interval-valued objective function are convex. The conditions guaranteeing the equivalence of the sets of LU-optimal solutions for the original constrained interval-valued extremum problem and for its associated penalized optimization problem with the interval-valued exact absolute value penalty function are given.     

Successive Optimization Method via Parametric Monotone Composition Formulation*

In this paper a successive optimization method for solving inequality constrained optimization problems is introduced via a parametric monotone composition reformulation. The global optimal value of the original constrained optimization problem is shown to be the least root of the optimal value function of an auxiliary parametric optimization problem, thus can be found via a bisection method. The parametric optimization subproblem is formulated in such a way that it is a one-parameter problem and its value function is a monotone composition function with respect to the original objective function and the constraints. Various forms can be taken in the parametric optimization problem in accordance with a special structure of the original optimization problem, and in some cases, the parametric optimization problems are convex composite ones. Finally, the parametric monotone composite reformulation is applied to study local optimality.     

Solving semi-infinite programs by smoothing projected gradient method

In this paper, we study a semi-infinite programming (SIP) problem with a convex set constraint. Using the value function of the lower level problem, we reformulate SIP problem as a nonsmooth optimization problem. Using the theory of nonsmooth Lagrange multiplier rules and Danskin’s theorem, we present constraint qualifications and necessary optimality conditions. We propose a new numerical method for solving the problem. The novelty of our numerical method is to use the integral entropy function to approximate the value function and then solve SIP by the smoothing projected gradient method. Moreover we study the relationships between the approximating problems and the original SIP problem. We derive error bounds between the integral entropy function and the value function, and between locally optimal solutions of the smoothing problem and those for the original problem. Using certain second order sufficient conditions, we derive some estimates for locally optimal solutions of problem. Numerical experiments show that the algorithm is efficient for solving SIP.     

A Connection between Singular Stochastic Control and Optimal Stopping

We show that the value function of a singular stochastic control problem is equal to the integral of the value function of an associated optimal stopping problem. The connection is proved for a general class of diffusions using the method of viscosity solutions.     

Subgradients of the Value Function to a Parametric Optimal Control Problem

This paper studies the first-order behavior of the value function of a parametric optimal control problem with linear constraints and nonconvex cost functions. By establishing an abstract result on the Fréchet subdifferential of the value functions of a parametric mathematical programming problem, a new formula for computing the Fréchet subdifferential of the value function to a parametric optimal control problem is obtained.     

Probabilistic interpretation of a coupled system of Hamilton–Jacobi–Bellman equations

In this paper, we give a probabilistic interpretation for a coupled system of Hamilton–Jacobi–Bellman equations using the value function of a stochastic control problem. First we introduce this stochastic control problem. Then we prove that the value function of this problem is deterministic and satisfies a (strong) dynamic programming principle. And finally, the value function is shown to be the unique viscosity solution of the coupled system of Hamilton–Jacobi–Bellman equations.     

含有积分、反周期和带P-Laplacian算子的分数阶微分方程边值问题解的存在性

利用格林函数的性质和Banach压缩映射原理讨论了含P-Laplacian算子反周期边值问题的解.首先,求出与该边值问题相关的格林函数并给出了格林函数的性质;然后将边值问题转化为与其等价的积分方程,利用格林函数的性质及Banach压缩映射原理得到边值问题解的唯一性;最后给出实例验证结果的合理性.     

Asymptotically optimal production policies in dynamic stochastic jobshops with limited buffers

We consider a production planning problem for a jobshop with unreliable machines producing a number of products. There are upper and lower bounds on intermediate parts and an upper bound on finished parts. The machine capacities are modelled as finite state Markov chains. The objective is to choose the rate of production so as to minimize the total discounted cost of inventory and production. Finding an optimal control policy for this problem is difficult. Instead, we derive an asymptotic approximation by letting the rates of change of the machine states approach infinity. The asymptotic analysis leads to a limiting problem in which the stochastic machine capacities are replaced by their equilibrium mean capacities. The value function for the original problem is shown to converge to the value function of the limiting problem. The convergence rate of the value function together with the error estimate for the constructed asymptotic optimal production policies are established.     

Deriving the Properties of Linear Bilevel Programming via a Penalty Function Approach

For the linear bilevel programming problem, we propose an assumption weaker than existing assumptions, while achieving similar results via a penalty function approach. The results include: equivalence between (i) existence of a solution to the problem, (ii) existence of an exact penalty function approach for solving the problem, and (iii) achievement of the optimal value of the equivalent form of the problem at some vertex of a certain polyhedral convex set. We prove that the assumption is both necessary and sufficient for the linear bilevel programming problem to admit an exact penalty function formulation, provided that the equivalent form of the problem has a feasible solution. A method is given for computing the minimal penalty function parameter value. This method can be executed by solving a set of linear programming problems. Lagrangian duality is also presented.     

Value Estimation Approach to the Iri-Imai Method for Constrained Convex Optimization

In this paper we propose an extension of the so-called Iri-Imai method to solve constrained convex programming problems. The original Iri-Imai method is designed for linear programs and assumes that the optimal objective value of the optimization problem is known in advance. Zhang (Ref. 9) extends the method for constrained convex optimization but the optimum value is still assumed to be known in advance. In our new extension this last requirement on the optimal value is relaxed; instead only a lower bound of the optimal value is needed. Our approach uses a multiplicative barrier function for the problem with a univariate parameter that represents an estimated optimum value of the original optimization problem. An optimal solution to the original problem can be traced down by minimizing the multiplicative barrier function. Due to the convexity of this barrier function the optimal objective value as well as the optimal solution of the original problem are sought iteratively by applying Newtons method to the multiplicative barrier function. A new formulation of the multiplicative barrier function is further developed to acquire computational tractability and efficiency. Numerical results are presented to show the efficiency of the new method.His research supported by Hong Kong RGC Earmarked Grant CUHK4233/01E.Communicated by Z. Q. Luo     

Directional Hölder Metric Regularity

This paper studies the first-order behavior of the value function of a parametric optimal control problem with nonconvex cost functions and control constraints. By establishing an abstract result on the Fréchet subdifferential of the value function of a parametric minimization problem, we derive a formula for computing the Fréchet subdifferential of the value function to a parametric optimal control problem. The obtained results improve and extend some previous results.     

Viscosity solution and impulse control of the diffusion model with reinsurance and fixed transaction costs

We consider an optimal impulse control problem on reinsurance, dividend and reinvestment of an insurance company. To close reality, we add fixed and proportional transaction costs to this problem. The value of the company is associated with expected present value of net dividends pay out minus the net reinvestment capitals until ruin time. We focus on non-cheap proportional reinsurance. We prove that the value function is a unique solution to associated Hamilton–Jacobi–Bellman equation, and establish the regularity property of the viscosity solution under a weak assumption. We solve the non-uniformly elliptic equation associated with the impulse control problem. Finally, we derive the value function and the optimal strategy of the control problem.     

ON HASEMAN BOUNDARY VALUE PROBLEM FOR A CLASS OF META-ANALYTIC FUNCTIONS

In this article, Haseman boundary value problem for a class of meta-analytic functions is studied. The expression of solution and the condition of solvability for Haseman boundary value problem are obtained by changing the problem discussed into the equivalent Haseman boundary value problem of bi-analytic function. And the expression of solution and the condition of solvability depend on the canonical matrix.     

Finite-horizon optimal investment with transaction costs: A parabolic double obstacle problem

This paper concerns optimal investment problem of a CRRA investor who faces proportional transaction costs and finite time horizon. From the angle of stochastic control, it is a singular control problem, whose value function is governed by a time-dependent HJB equation with gradient constraints. We reveal that the problem is equivalent to a parabolic double obstacle problem involving two free boundaries that correspond to the optimal buying and selling policies. This enables us to make use of the well-developed theory of obstacle problem to attack the problem. The C2,1 regularity of the value function is proven and the behaviors of the free boundaries are completely characterized.     

具有振动边值的扩散方程Dirichlet问题

本文以上（下）连续函数作为扩散方程u_t=1/2Δu+cu 在Ｄ内的Ｄｉｒｉｃｈｌｅｔ问题边值函数，讨论了振动边值的Ｄｉｒｉｃｈｌｅｔ问题，并用概率方法证明解的存在性、唯一性和稳定性，把古典Ｄｉｒｉｃｈｌｅｔ问题边值条件减弱到最一般情形     

Directional differentiability of the optimal value function in convex semi-infinite programming

In this paper, directional differentiability properties of the optimal value function of a parameterized semi-infinite programming problem are studied. It is shown that if the unperturbed semi-infinite programming problem is convex, then the corresponding optimal value function is directionally differentiable under mild regularity assumptions. A max-min formula for the directional derivatives, well-known in the finite convex case, is given.