Global efficiency in multiobjective programming *

In this paper, we are concerned with global efficiency in multiobjective optimization. After exposing a property of a cone-subconvexlike function, we prove that a local weakly efficient solution, a local efficient solution and a local properly efficient solution are respectively a global weakly efficient solution, a global efficient solution and a global properly efficient solution of a multiobjective programming problem if cone- subconvexlikeness or cone-pre-invexity is assumed     

GLOBAL EXISTENCE OF THE SOLUTION FOR THE LANDAU-LIFSHITZ EQUATION OF THE FERROMAGNETIC SPIN CHAIN

1IntroductionInthepresentpaper,wecollsidertileLandau-LifSllitzequationoftileferromagneticspinchainwhichtakestheform:where"x'ldenotesthevectorcrossproductinR',fi=(--D,D),D>0,u=(ul,u3,u3):fixR -R3istilespinvector,or>0isaGilbertdampingconstant,Pisarealparameter,J=diag(ri,acfac)isaconstantmatrix.TheaboveequationarisesinthedoublyanisotropicHeisenbergspinsystem.Thissystemisimpliedbytileconservationofenergyandmagnitudeofu.SeeDanielandLab.hmanan[1]please.Insomeferromagneticchainsystems,thematri…     

Global Well-posedness for an incompressible flow with intrinsic degrees of freedom in bounded domains

We consider a mathematical model for an incompressible Newtonian fluid with intrinsic degrees of freedom in a smooth bounded domain. We first show that there exists a unique local strong solution for large initial data. Then, we prove that the local strong solution is indeed global provided that the initial data is sufficiently small. Furthermore, we prove that when the strong solution exists, all the global weak solutions constructed by Lions must be equal to the unique strong solution with the same initial data.     

On the Properties of the Solution of a Strongly Degenerate Parabolic Equation

ＯｎｔｈｅＰｒｏｐｅｒｔｉｅｓｏｆｔｈｅＳｏｌｕｔｉｏｎｏｆａＳｔｒｏｎｇｌｙＤｅｇｅｎｅｒａｔｅＰａｒａｂｏｌｉｃＥｑｕａｔｉｏｎＣｈｅｎｇＦｕｘｉａ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ＴｓｉｎｇｈｕａＵｎｉｖｅｒｓｉｔ...     

求解多项式规划的一个全局最优化算法

提出一个求解带箱子约束的一般多项式规划问题的全局最优化算法, 该算法包含两个阶段, 在第一个阶段, 利用局部最优化算法找到一个局部最优解. 在第二阶段, 利用一个在单位球上致密的向量序列, 将多元多项式转化为一元多项式, 通过求解一元多项式的根, 找到一个比当前局部最优解更好的点作为初始点, 回到第一个 阶段, 从而得到一个更好的局部最优解, 通过两个阶段的循环最终找到问题的全局最优解, 并给出了算法收敛性分析. 最后, 数值结果表明了算法是有效的.     

Global existence and asymptotic dynamics in a 3D fractional chemotaxis system with singular sensitivity

In this paper, we investigate the global existence and asymptotic dynamics of solutions to a fractional singular chemotaxis system in three dimensional whole space. We deal with the new difficulties arising from fractional diffusion by using Riesz transform and Kato-Ponce’s commutator estimates appropriately, and establish the local existence of solution. Then with the help of combining the local existence and the a priori estimates, the global existence and uniqueness of solution with small initial data is derived. Moreover, we obtain the asymptotic decay rates of solution by the method of energy estimates.     

一类奇异拟线性椭圆型方程组的可解性

研究了一类P-Laplacian方程组边值问题正径向整体解的存在性和唯一性.首先,利用隐函数定理证明了该问题的局部解的存在性与唯一性,以及解对初值的连续依赖性.最后,证明了该问题存在唯一的正径向整体解.     

Global existence and blowup of a localized problem with free boundary

This paper is concerned with a double fronts free boundary problem for the heat equation with a localized nonlinear reaction term. The local existence and uniqueness of the solution are given by applying the contraction mapping theorem. Then we present some conditions so that the solution blows up in finite time. Finally, the long-time behavior of the global solution is discussed. We show that the solution is global and fast if the initial data is small and that a global slow solution is possible when the initial data is suitably large.     

Global fast and slow solutions of a localized problem with free boundary

In this paper,we consider a localized problem with free boundary for the heat equation in higher space dimensions and heterogeneous environment.For simplicity,we assume that the environment and solution are radially symmetric.First,by using the contraction mapping theorem,we prove that the local solution exists and is unique.Then,some sufficient conditions are given under which the solution will blow up in finite time.Our results indicate that the blowup occurs if the initial data are sufficiently large.Finally,the long time behavior of the global solution is discussed.It is shown that the global fast solution does exist if the initial data are sufficiently small,while the global slow solution is possible if the initial data are suitably large.     

A local superconvergence analysis of the finite element method for the Stokes equations by local projections

In this paper, we focus on a local superconvergence analysis of the finite element method for the Stokes equations by local projections. The local and global superconvergence results of finite element solutions are provided for the Stokes problem under some corresponding regularity assumptions. Conclusion can be drawn that the local superconvergence has advantages over the global superconvergence in two important aspects. On the one hand, it offsets theoretical limitation in practical applications. On the other hand, interior estimates are derived on the base of local properties of the domain without global smoothness for the exact solution and prior regularity of the problem globally over the whole domain.     

A chaos-based evolutionary algorithm for general nonlinear programming problems

In this paper we present a chaos-based evolutionary algorithm (EA) for solving nonlinear programming problems named chaotic genetic algorithm (CGA). CGA integrates genetic algorithm (GA) and chaotic local search (CLS) strategy to accelerate the optimum seeking operation and to speed the convergence to the global solution. The integration of global search represented in genetic algorithm and CLS procedures should offer the advantages of both optimization methods while offsetting their disadvantages. By this way, it is intended to enhance the global convergence and to prevent to stick on a local solution. The inherent characteristics of chaos can enhance optimization algorithms by enabling it to escape from local solutions and increase the convergence to reach to the global solution. Twelve chaotic maps have been analyzed in the proposed approach. The simulation results using the set of CEC’2005 show that the application of chaotic mapping may be an effective strategy to improve the performances of EAs.     

A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints

In order to find a global solution for a quadratic program with linear complementarity constraints (QPLCC) more quickly than some existing methods, we consider to embed a local search method into a global search method. To say more specifically, in a branch-and-bound algorithm for solving QPLCC, when we find a new feasible solution to the problem, we utilize an extreme point algorithm to obtain a locally optimal solution which can provide a better bound and help us to trim more branches. So, the global algorithm can be accelerated. A preliminary numerical experiment was conducted which supports the new algorithm.     

Doubly Nonlinear Degenerate Parabolic Systems with Coupled Nonlinear Boundary Conditions

In this paper, we study the global existence and the global nonexistence of doubly nonlinear degenerate parabolic systems with nonlinear boundary conditions. We first prove a local existence result by the regularization method. Next, we construct a weak comparison principle. Then we discuss the large time behavior of solutions by using a modified upper and lower solution methods and constructing various upper and lower solutions. Necessary and sufficient conditions on the global existence of all positive (weak) solutions are obtained.     

Global well-posedness for the viscous shallow water system with Korteweg type

In this paper, we study the Cauchy problem for a viscous shallow water system with Korteweg type in Sobolev spaces. We first establish the local well-posedness of the solution by using the Friedrich method and compactness arguments. Then, we prove the global existence of the solution to the system for the small initial data.     

Le prolongement analytique de la solution du problème de Cauchy pour un certain opérateur différentiel à coefficients polynomiaux III

In part II of this series [To appear in J. Fixed Point Theory Appl. 14], we have studied analytic continuation and global structure of singularities of the solution of the Cauchy problem with meromorphic data for certain differential operators with principal part of polynomial coefficients in the complex domain. On the other hand, by a classical result of asymptotic development, we obtain a local expression of this solution. In this paper, we study an analytic continuation of this local solution. This gives a complement of part II.     

Superlinear Convergence of a Newton-Type Algorithm for Monotone Equations

We consider the problem of finding solutions of systems of monotone equations. The Newton-type algorithm proposed in Ref. 1 has a very nice global convergence property in that the whole sequence of iterates generated by this algorithm converges to a solution, if it exists. Superlinear convergence of this algorithm is obtained under a standard nonsingularity assumption. The nonsingularity condition implies that the problem has a unique solution; thus, for a problem with more than one solution, such a nonsingularity condition cannot hold. In this paper, we show that the superlinear convergence of this algorithm still holds under a local error-bound assumption that is weaker than the standard nonsingularity condition. The local error-bound condition may hold even for problems with nonunique solutions. As an application, we obtain a Newton algorithm with very nice global and superlinear convergence for the minimum norm solution of linear programs.This research was supported by the Singapore-MIT Alliance and the Australian Research Council.     

Exactness and algorithm of an objective penalty function

Penalty function is an important tool in solving many constrained optimization problems in areas such as industrial design and management. In this paper, we study exactness and algorithm of an objective penalty function for inequality constrained optimization. In terms of exactness, this objective penalty function is at least as good as traditional exact penalty functions. Especially, in the case of a global solution, the exactness of the proposed objective penalty function shows a significant advantage. The sufficient and necessary stability condition used to determine whether the objective penalty function is exact for a global solution is proved. Based on the objective penalty function, an algorithm is developed for finding a global solution to an inequality constrained optimization problem and its global convergence is also proved under some conditions. Furthermore, the sufficient and necessary calmness condition on the exactness of the objective penalty function is proved for a local solution. An algorithm is presented in the paper in finding a local solution, with its convergence proved under some conditions. Finally, numerical experiments show that a satisfactory approximate optimal solution can be obtained by the proposed algorithm.     

Zero Mach number limit in critical spaces for compressible Navier-Stokes equations

We are concerned with the existence and uniqueness of local or global solutions for slightly compressible viscous fluids in the whole space. In [6] and [7], we proved local and global well-posedness results for initial data in critical spaces very close to the one used by H. Fujita and T. Kato for incompressible flows (see [14]). In the present paper, we address the question of convergence to the incompressible model (for ill-prepared initial data) when the Mach number goes to zero. When the initial data are small in a critical space, we get global existence and convergence. For large initial data and a bit of additional regularity, the slightly compressible solution is shown to exist as long as the corresponding incompressible solution does. As a corollary, we get global existence (and uniqueness) for slightly compressible two-dimensional fluids.     

Global asymptotic behavior in a Lotka–Volterra competition system with spatio-temporal delays

This paper is concerned with a Lotka–Volterra competition system with spatio-temporal delays. By using the linearization method, we show the local asymptotic behavior of the nonnegative steady-state solutions. Especially, the global asymptotic stability of the positive steady-state solution is investigated by the method of upper and lower solutions. The result of global asymptotic stability implies that the system has no nonconstant positive steady-state solution.     

Stabilization of stationary affine control systems with discrete time

We obtain new sufficient conditions for the local and global asymptotic stabilization of the zero solution of a nonlinear affine control system with discrete time and with constant coefficients by a continuous state feedback. We assume that the zero solution of the free system is Lyapunov stable. For systems with linear drift, we construct a bounded control in the problem of global asymptotic state and output stabilization. Corollaries for bilinear systems are obtained.