New efficient numerical procedures for solving stochastic variational problems with a priori maximum pointwise error estimates

In a previous paper we gave a new formulation and derived the Euler equations and other necessary conditions to solve strong, pathwise, stochastic variational problems with trajectories driven by Brownian motion. Thus, unlike current methods which minimize the control over deterministic functionals (the expected value), we find the control which gives the critical point solution of random functionals of a Brownian path and then, if we choose, find the expected value.This increase in information is balanced by the fact that our methods are anticipative while current methods are not. However, our methods are more directly connected to the theory and meaningful examples of deterministic variational theory and provide better means of solution for free and constrained problems. In addition, examples indicate that there are methods to obtain nonanticipative solutions from our equations although the anticipative optimal cost function has smaller expected value.In this paper we give new, efficient numerical methods to find the solution of these problems in the quadratic case. Of interest is that our numerical solution has a maximal, a priori, pointwise error of O(h3/2) where h is the node size. We believe our results are unique for any theory of stochastic control and that our methods of proof involve new and sophisticated ideas for strong solutions which extend previous deterministic results by the first author where the error was O(h²).We note that, although our solutions are given in terms of stochastic differential equations, we are not using the now standard numerical methods for stochastic differential equations. Instead we find an approximation to the critical point solution of the variational problem using relations derived from setting to zero the directional derivative of the cost functional in the direction of simple test functions.Our results are even more significant than they first appear because we can reformulate stochastic control problems or constrained calculus of variations problems in the unconstrained, stochastic calculus of variations formulation of this paper. This will allow us to find efficient and accurate numerical solutions for general constrained, stochastic optimization problems. This is not yet being done, even in the deterministic case, except by the first author.     

Monotonic solutions of a quadratic integral equation of fractional order

In the paper we indicate an error made in the proof of the main result of the paper [M.A. Darwish, On quadratic integral equation of fractional orders, J. Math. Anal. Appl. 311 (2005) 112-119]. Moreover, we provide correct proof of a slightly modified version of the mentioned result. The main tool used in our proof is the technique associated with the Hausdorff measure of noncompactness.     

Optimality and duality in multiobjective fractional programming involving ρ-semilocally type I-preinvex and related functions

Optimality conditions are obtained for a nonlinear fractional multiobjective programming problem involving η-semidifferentiable functions. Also, a general dual is formulated and a duality result is proved using concepts of generalized ρ-semilocally type I-preinvex functions.     

The Nature of Electronic Charge

Advances in gauge theories and unified theories have not thrown light on the meaning of electron. The problem of the origin of electronic charge is made precise, new insights gained from Weyl space are summarized, and the origin of charge in terms of fractional spin is suggested. A new perspective on the abelian Chern-Simons theory is presented to explain charge.     

On a Polynomial Fractional Formulation for Independence Number of a Graph

In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches to the maximum independent set problem.     

Generalized fractional programming duality: A parametric approach

Using a parametric approach, duality is presented for a minimax fractional programming problem that involves several ratios in the objective function.The first author is thankful to Natural Science and Engineering Research Council of Canada for financial support through Grant A-5319, and the authors are thankful to the anonymous referees for useful suggestions.     

β分式α稳定过程的1/H变差

本文主要讨论了β分式α稳定过程的1/H变差,这对关于β分式α稳定过程的随机分析是非常重要的.     

分数布朗运动的新表示

构造了一类新的分数布朗运动模型，它不同于Mandelbrot,Barton及Decreusefond等人所定义的分数布朗运动模型。     

标的资产服从几何分数布朗运动的期权定价

本文在M ogens B ladt和T ina H av iid R ydberg无市场假设,仅利用价格过程的实际概率的期权保险精算定价模型的基础上,得出了标的资产服从几何分数布朗运动的欧式期权定价公式,并说明了几何布朗运动是本文的一种特殊情况.     

Fractional-Linear Transformations of Operator Balls; Applications to Dynamical Systems

The operator sets, which are the subject of this paper, have been studied in many papers where, under different restrictions on the generating operators, convexity, compactness in the weak operator topology, and nonemptiness were proved for sets of different classes under study. Then the results obtained were used in these papers to solve several applied problems. Namely, they played the key role in establishing the dichotomy of nonautonomous dynamical systems, with either continuous or discrete time. In the present paper, we generalize and sharpen the already known criteria and obtain several new criteria for convexity, compactness, and nonemptiness of several special operator sets. Then, using the assertions obtained, we construct examples of sets of the form under study which are nonconvex, noncompact in the weak operator topology, as well as empty, and are generated by ＂smooth＂ operators of a special class. The existence problem for such sets remained open until the authors of this paper announced some of its results.