THEORY AND APPLICATIONS OF MONOTONE SEMIFLOWS FOR FUNCTIONAL DIFFERENTIAL EQUATIONS

The theory of monotone semiflows has been widely applied to functional differential equations (FDEs). The studies on the theory and applications of monotone semiflows for FDEs are very important and interesting. A brief des-cription of our recent works are as follows.By using general monotone semiflow theory, several results of positively invariant sets, monotone solutions and contracting rectangles of retarded functional differential equations(RFDEs) with infinite delay are gained under the assumption of quasimonotonicity; sufficient conditions for the existence, un-iqueness and global attractivity of periodic solutions are also established by combining the theory of monotone semiflows for neutral functional differential equations(NFDEs) and Krasnoselskii's fixed point theorem.     

Finite-Dimensional Approximations for Scattering Theory Operators in the Wave-Packet Representation

We consider some types of packet discretization for continuous spectra in quantum scattering problems. As we previously showed, this discretization leads to a convenient finite-dimensional (i.e., matrix) approximation for integral operators in the scattering theory and allows reducing the solution of singular integral equations connected with the scattering theory to some suitable purely algebraic equations on an analytic basis. All singularities are explicitly singled out. Our primary emphasis is on realizing the method practically.     

An approximate proximal-extragradient type method for monotone variational inequalities

Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method.     

Boundary value problems for first order impulsive delay differential equations with a parameter

In this paper, by means of the method of upper and lower solutions and monotone iterative technique, the existence of maximal and minimal solutions of the boundary value problems for first order impulsive delay differential equations is established.     

On the existence of positive solutions for a class of singular boundary value problems

In this paper, by the use of a fixed point theorem, many new necessary and sufficient conditions for the existence of positive solutions in C[0,1]∩C¹[0,1]∩C²(0,1) or C[0,1]∩C²(0,1) are presented for singular superlinear and sublinear second-order boundary value problems. Singularities at t=0, t=1 will be discussed.     

Existence of two solutions of m-point boundary value problem for second order dynamic equations on time scales

In this paper, by means of a new twin fixed-point theorem in a cone, the existence of at least two positive solutions of m-point boundary value problem for second order dynamic equations on time scales is considered.     

Global Solution of Optimization Problems with Parameter-Embedded Linear Dynamic Systems

This paper develops a theory for the global solution of nonconvex optimization problems with parameter-embedded linear dynamic systems. A quite general problem formulation is introduced and a solution is shown to exists. A convexity theory for integrals is then developed to construct convex relaxations for utilization in a branch-and-bound framework to calculate a global minimum. Interval analysis is employed to generate bounds on the state variables implied by the bounds on the embedded parameters. These bounds, along with basic integration theory, are used to prove convergence of the branch-and-bound algorithm to the global minimum of the optimization problem. The implementation of the algorithm is then considered and several numerical case studies are examined thoroughly     

Interior point cutting plane method for optimal power flow

In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective.     

具有无限时滞的二阶微分方程解的存在性

§ 1.　IntroductionRecently ,thedifferentialequationswithdeviatingargumentswereusuallydiscussed(see[1 ],[4],[5 ]) .In [1 ],AGARWALRPandO’REGANDconsideredequationy″(t) =f(t,y(t) ,y(σ(t) ) ) ,　a.e .t∈ [0 ,1 ]y(t) =ψ(t) ,　　　　　　　　t∈ [-r ,0 ]y( 1 ) =a ,( )andtheydiscussedtheexistenceofatleastonesolutionforequation ( ) .Inthispaper ,weconsideramoregeneralequation-x″(t) =f(t ,xt) ,　t∈ [0 ,1 ]x(t) =ψ(t) ,　　　　t∈ ( -∞ ,0 ]x( 0 ) =x( 1 ) =0 ,( 1 .1 )andsomeexistencetheor…     

小型企业规模的有效性分析

在当代企业纷纷追求规模的不断扩大的同时，统计数据却显示企业平均规模不断下降的事实趋势。论根据数学、经济学与博弈论的有关理论对企业规模小型化的内在要求进行了探讨，分析的结论一致证明：粘型化规模在当代经济环境中是充分有效的。