An overview of representation theorems for static risk measures

In this paper, we give an overview of representation theorems for various static risk measures: coherent or convex risk measures, risk measures with comonotonic subadditivity or convexity, law-invariant coherent or convex risk measures, risk measures with comonotonic subadditivity or convexity and respecting stochastic orders. This work was supported by National Natural Science Foundation of China (Grant No. 10571167), National Basic Research Program of China (973 Program) (Grant No. 2007CB814902), and Science Fund for Creative Research Groups (Grant No. 10721101)     

A level set method to reconstruct the discontinuity of the conductivity in EIT

In this paper, one level set method is applied to finding the interface of discontinuity of the conductivity in EIT(electrical impedance tomography) problem. By choosing one suitable velocity function, a level set reconstruction algorithm is proposed. The theoretical results for EIT problem and regularization are given. Finally the numerical examples demonstrate that the reconstruction algorithm is efficient and stable. The work was supported by the National Natural Science Foundation of China (Grant Nos. 10431030, 10771138), the Shanghai Natural Science Foundation (Grant No. 07JC14001), the National Basic Research Program (Grant No. 2005CB321701) and Ministry of Education of China and State Administration of Foreign Experts Affairs of China under an 111 project (Grant No. B08018).     

Global solutions of stochastic 2D Navier-Stokes equations with Lévy noise

In this paper, we prove the global existence and uniqueness of the strong and weak solutions for 2D Navier-Stokes equations on the torus perturbed by a Lévy process. The existence of invariant measure of the solutions are proved also. This work was supported by National Basic Research Program of China (Grant No. 2006CB8059000), Science Fund for Creative Research Groups (Grant No. 10721101), National Natural Science Foundation of China (Grant Nos. 10671197, 10671168), Science Foundation of Jiangsu Province (Grant Nos. BK2006032, 06-A-038, 07-333) and Key Lab of Random Complex Structures and Data Science, Chinese Academy of Sciences     

A maximum principle for optimal control problem of fully coupled forward-backward stochastic systems with partial information

The paper is concerned with a stochastic optimal control problem in which the controlled system is described by a fully coupled nonlinear forward-backward stochastic differential equation driven by a Brownian motion. It is required that all admissible control processes are adapted to a given subfiltration of the filtration generated by the underlying Brownian motion. For this type of partial information control, one sufficient (a verification theorem) and one necessary conditions of optimality are proved. The control domain need to be convex and the forward diffusion coefficient of the system can contain the control variable. This work was partially supported by Basic Research Program of China (Grant No. 2007CB814904), National Natural Science Foundation of China (Grant No. 10325101) and Natural Science Foundation of Zhejiang Province (Grant No. Y605478, Y606667)     

A new proof of <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript> estimates for the parabolic polyharmonic equations

In this paper we obtain local L ^p estimates for the parabolic polyharmonic equations by a straightforward approach. Yao was supported by the Innovation Foundation of Shanghai University (Grant No. A10-0101-08-905), Shanghai Leading Academic Discipline Project (Grant No. J50101) and Key Disciplines of Shanghai Municipality (Grant No. S30104). Zhou was supported by the National Basic Research Program of China (Grant No. 2006CB705700), National Natural Science Foundation of China (Grant No. 60532080), and the Key Project of Chinese Ministry of Education (Grant No. 306017)     

The Paley-Wiener theorem in the non-commutative and non-associative octonions

The Paley-Wiener theorem in the non-commutative and non-associative octonion analytic function space is proved. This work was supported by the National Basic Research Program of China (Grant No. 1999075105), the National Natural Science Foundation of China (Grant No. 10471002) and Research Foundation for Doctoral Programm (Grant No. 20050574002)     

Ruin probability of the renewal model with risky investment and large claims

The ruin probability of the renewal risk model with investment strategy for a capital market index is investigated in this paper. For claim sizes with common distribution of extended regular variation, we study the asymptotic behaviour of the ruin probability. As a corollary, we establish a simple asymptotic formula for the ruin probability for the case of Pareto-like claims. This work was supported by National Natural Science Foundation of China (Grant Nos. 10571167, 70501028), the Beijing Sustentation Fund for Elitist (Grant No. 20071D1600800421), the National Social Science Foundation of China (Grant No. 05&ZD008) and the Research Grant of Renmin University of China (Grant No. 08XNA001)     

The equality cases for the inequalities of Oppenheim and Schur for positive semi-definite matrices

In this paper, necessary and sufficient conditions for equality in the inequalities of Oppenheim and Schur for positive semidefinite matrices are investigated. Supported by National Natural Science Foundation of China (No. 10531070), National Basic Research Program of China 973 Program (No. 2006CB805900), National Research Program of China 863 Program (No. 2006AA11Z209) and the Natural Science Foundation of Shanghai (Grant No. 06ZR14049).     

On the Stackelberg strategy in nonzero-sum games

The properties of the Stackelberg solution in static and dynamic nonzero-sum two-player games are investigated, and necessary and sufficient conditions for its existence are derived. Several game problems, such as games where one of the two players does not know the other's performance criterion or games with different speeds in computing the strategies, are best modeled and solved within this solution concept. In the case of dynamic games, linear-quadratic problems are formulated and solved in a Hilbert space setting. As a special case, nonzero-sum linear-quadratic differential games are treated in detail, and the open-loop Stackelberg solution is obtained in terms of Riccati-like matrix differential equations. The results are applied to a simple nonzero-sum pursuit-evasion problem.This work was supported in part by the US Air Force under Grant No. AFOSR-68-1579D, in part by NSF under Grant No. GK-36276, and in part by the Joint Services Electronics Program under Contract No. DAAB-07-72-C-0259 with the Coordinated Science Laboratory, University of Illinois, Urbana, Illinois.     

A robust secant method for optimization problems with inequality constraints

This paper presents a secant method, based on R. B. Wilson's formula for the solution of optimization problems with inequality constraints. Global convergence properties are ensured by grafting the secant method onto a phase I - phase II feasible directions method, using a rate of convergence test for crossover control.This research was sponsored by the National Science Foundation, Grant No. ENG-73-08214 and Grant No. (RANN)-ENV-76-04264, and by the Joint Services Electronics Program. Contract No. F44620-76-C-0100.     

The viability property of controlled jump diffusion processes

In this paper, we first give a comparison theorem of viscosity solution to some nonlinear second order integrodifferential equation. And then using the comparison theorem, we obtain a necessary and sufficient condition for the viability property of some controlled jump diffusion processes which can keep the solution within a constraint K.     

Gaining efficiency via weighted estimators for multivariate failure time data

Multivariate failure time data arise frequently in survival analysis. A commonly used technique is the working independence estimator for marginal hazard models. Two natural questions are how to improve the efficiency of the working independence estimator and how to identify the situations under which such an estimator has high statistical efficiency. In this paper, three weighted estimators are proposed based on three different optimal criteria in terms of the asymptotic covariance of weighted estimators. Simplified close-form solutions are found, which always outperform the working independence estimator. We also prove that the working independence estimator has high statistical efficiency, when asymptotic covariance of derivatives of partial log-likelihood functions is nearly exchangeable or diagonal. Simulations are conducted to compare the performance of the weighted estimator and working independence estimator. A data set from Busselton population health surveys is analyzed using the proposed estimators. This work was supported by National Natural Science Foundation of China (Grant No. 10628104), Fan was also supported by National Institutes of Health (Grant No. R01-GM072611) and Natural Science Foundation (Grant No. DMS-0714554), Zhou was supported by National Natural Science Funds for Distinguisheel Young Scholar (Grant No. 70825004), National Natural Science Foundation of China (Grant Nos. 10731010, 10628104), the National Basic Research Program (Grant No. 2007CB814902), Creative Research Groups of China (Grant No. 10721101) and Leading Academic Disipline Program, the 10 ^th five year plan of 211 Project for Shanghai University of Finance and Economics (the 3 ^rd phase), Cai was supported by National Institutes of Health (Grant No. R01-HL57444)     

A Semidefinite Programming Heuristic for Quadratic Programming Problems with Complementarity Constraints

The presence of complementarity constraints brings a combinatorial flavour to an optimization problem. A quadratic programming problem with complementarity constraints can be relaxed to give a semidefinite programming problem. The solution to this relaxation can be used to generate feasible solutions to the complementarity constraints. A quadratic programming problem is solved for each of these feasible solutions and the best resulting solution provides an estimate for the optimal solution to the quadratic program with complementarity constraints. Computational testing of such an approach is described for a problem arising in portfolio optimization.Research supported in part by the National Science Foundations VIGRE Program (Grant DMS-9983646).Research partially supported by NSF Grant number CCR-9901822.     

On the limit cycles of a quintic planar vector field

This paper concerns the number and distributions of limit cycles in a Z_2-equivariant quintic planar vector field.25 limit cycles are found in this special planar polynomial system and four different configurations of these limit cycles are also given by using the methods of the bifurcation theory and the qualitative analysis of the differential equation.It can be concluded that H(5)≥25=5~2, where H(5)is the Hilbert number for quintic polynomial systems.The results obtained are useful to study the weakened 16th Hilbert problem.     

Value of information in two-team zero-sum problems

The situation in which two groups of people have conflicts of interest is considered as a two-team zero-sum game problem. Two special cases of this problem are solved to illustrate that communication among members of a team may not be worth-while and extra information need not always be desired by decision makers. In the appendix, it is shown that the optimal saddle-point solution exists and is still affine for the general problem with quadratic Gaussian performance index.Dedicated to Professor M. R. HestenesThe research reported in this paper was made possible through support extended to the Division of Engineering and Applied Physics, Harvard University, by the U.S. Office of Naval Research under the Joint Services Electronics Program, Contract No. N00014-67-A-0298-0006, and by the National Science Foundation, Grant No. GK-31511.     

A decomposition of time scales for iterative computation of time-optimal controls

An iterative procedure, exploiting the multiple time scale properties of systems with slow and fast modes, is presented. This procedure solves the time-optimal problem for higher-order systems iteratively via the solutions of simple second-order problems. Computational complexity is so reduced that fourth-order problems can be solved using a microprocessor or programmable calculator.This work was supported in part by the Joint Services Electronics Program (US Army, US Navy, and US Air Force) under Contract No. DAAB-07-72-C-0259, in part by the US Air Force under Grant No. AFOSR-73-2570, and in part by the National Science Foundation under Grant No. ENG 74-20091.     

An implementable algorithm for the optimal design centering,tolerancing, and tuning problem

An implementable master algorithm for solving optimal design centering, tolerancing, and tuning problems is presented. This master algorithm decomposes the original nondifferentiable optimization problem into a sequence of ordinary nonlinear programming problems. The master algorithm generates sequences with accumulation points that are feasible and satisfy a new optimality condition, which is shown to be stronger than the one previously used for these problems.This research was sponsored by the National Science Foundation (RANN), Grant No. ENV-76-04264, and by the Joint Services Electronic Program, Contract No. F44620-76-C-0100.     

Analysis of search-extension method for finding multiple solutions of nonlinear problem

For numerical computations of multiple solutions of the nonlinear elliptic problemΔu f(u)=0 inΩ, u=0 onΓ, a search-extension method (SEM) was proposed and systematically studied by the authors. This paper shall complete its theoretical analysis. It is assumed that the nonlinearity is non-convex and its solution is isolated, under some conditions the corresponding linearized problem has a unique solution. By use of the compactness of the solution family and the contradiction argument, in general conditions, the high order regularity of the solution u∈H~(1 α),α>0 is proved. Assume that some initial value searched by suitably many eigenbases is already fallen into the neighborhood of the isolated solution, then the optimal error estimates of its nonlinear finite element approximation are shown by the duality argument and continuation method.     

Risk-sensitive and risk-neutral control for continuous-time hidden Markov models

In this paper the optimal control of a continuous-time hidden Markov model is discussed. The risk-sensitive problem involves a cost function which has an exponential form and a risk parameter, and is solved by defining an appropriate information state and dynamic programming. As the risk parameter tends to zero, the classical risk-neutral optimal control problem is recovered. The limits are proved using viscosity solution methods.The first author wishes to acknowledge the funding of the activities of the Cooperative Research Centre for Robust and Adaptive Systems by the Australian Commonwealth Government under the Cooperative Research Centers Program. The support of NSERC Grant A7964 is acknowledged by the second author, as is the hospitality of the Department of Systems Engineering and the Cooperative Research Centre for Robust and Adaptive Systems, Australian National University, in July 1993.     

On Connection Between the Structure of a Finite Group and the Properties of Its Prime Graph

It is shown that the condition of nonadjacency of 2 and at least one odd prime in the Gruenberg-Kegel graph of a finite group G under some natural additional conditions suffices to describe the structure of G; in particular, to prove that G has a unique nonabelian composition factor. Applications of this result to the problem of recognition of finite groups by spectrum are also considered.Original Russian Text Copyright © 2005 Vasilev A. V.The author was supported by the Russian Foundation for Basic Research (Grant 05-01-00797), the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-2069.2003.1), the Program Development of the Scientific Potential of Higher School of the Ministry for Education of the Russian Federation (Grant 8294), the Program Universities of Russia (Grant UR.04.01.202), and a grant of the Presidium of the Siberian Branch of the Russian Academy of Sciences (No. 86-197).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 511–522, May–June, 2005.