Degenerate nonlinear hyperbolic conservation laws: Non classical geometrical theory

Kinetic selection principles have been shown to be useful and physically reasonable in nonlinear hyperbolic problems with large amplitude phase transitions. We refer to Abeyaratne and Knowles, [A-K], for discussion on the subject. They also have been used for degenerate nonlinear problems, where the genuine nonlinearity property of Lax is violated. This is the framework of Liu, [Li], in the kinetic situation of Hayes and Le Floch, [H-L], where their so-called non classical shocks may be seen as small amplitude phase transitions. Here, we describe the local geometry generated by the generic non genuinely nonlinear assumption. A geometric kinetic criterion can be used to select indeterminate simple waves and obtain the well-posedness of the local Riemann problem. A particular case is the entropic kinetic criterion of Hayes and Le Floch.

---

Sunto Principi di selezione cinetica sono stati mostrati utili e fisicamente ragionevoli in problemi iperbolici con transizioni di fase di grande ampiezza. Ci riferiamo ad Abeyaratne e Knowles, [A-K], per discussioni sull'argomento. Detti principi sono stati usati per problemi nonlineari degeneri, dove la proprietà di genuina nonlinearità di Lax è violata. Questo è la prospettiva di Liu, [Li], nella situazione cinetica di Hayes e Le Floch, [H-L], dove i loro così detti urti non classici possono essere considerati come transizioni di fase di piccola ampiezza. Qui, descriviamo la geometria locale generata dall'ipotesi generica genuinamente nonlineare. Un criterio di geometria cinetica può essere usato per selezionare onde semplici indeterminate ed ottenere la buona posizione per il problema locale di Riemann. Un caso particolare è il criterio di entropia cinetico di Hayes e Le Floc.

     

单调全局最优化问题的凸化外逼近算法

单调优化是指目标函数与约束函数均为单调函数的全局优化问题．本文提出一种新的凸化变换方法把单调函数化为凸函数，进而把单调优化问题化为等价的凸极大或凹极小问题，然后采用Hoffman的外逼近方法来求得问题的全局最优解．我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较，通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法．     

反对称正交对称矩阵反问题

本文讨论一类反对称正交对称矩阵反问题及其最佳逼近．研究了这类矩阵的一些性质，利用这些性质给出了反问题解存在的一些条件和解的一般表达式，不仅证明了最佳逼近解的存在唯一性，而且给出了此解的具体表达式．     

一类具有非局部反应扩散方程的奇摄动问题

本文讨论一类具非局部反应扩散方程的奇摄动初始边值问题，利用迭代法及微分不等式，研究了初始边值问题的存在唯一及其渐近性态。     

On a Class of Functionals Whose Local Minima are Global

In this note we introduce a suitable class of functionals, including the class of integral functionals, and prove that any (strict) local minimum of a functional of this class, defined on a decomposable space, is a (strict) global minimum. So, the recent result obtained by Giner in [1] is specified and extended.     

逆（反）对策问题与“奇门遁甲”预测理论（术）

本文首先提出逆（反）对策这一新问题，给出了数学模型；探讨了“奇门遁甲”预测理论（术）中的数学问题；通过系统分析“专门遁甲”预测过程，可知它的预测过程隐含着一个特殊的逆（反）对策问题；最后指出逆（反）对策问题的广泛存在并给出案例分析．     

A Bicriterial Optimization Problem of Antenna Design

In this paper we consider a special optimization problem withtwo objectives which arises in antenna theory. It is shown that thisabstract bicriterial optimization problem has at least one solution.Discretized versions of this problem are also discussed, and therelationships between these finite dimensional problems and the infinitedimensional problem are investigated. Moreover, we presentnumerical results for special parameters using a multiobjectiveoptimization method.     

多级制造系统的最优化模型及其应用

多级制造系统是现代制造业的主要加工方式，系统的每一级的加工速度和加工周期是系统设计的主要决策变量，正确确定这两个变量是系统得到优化的主要目标。本文导出了系统优化的基本模型，它包括系统各级的生产时间、等待时间、生产速度、生产成本以及系统的循环时间、总成本、产品利润和利润率等，并给出了一个应用实例。     

Parallel Algorithm for Unconstrained Optimization Based on Decomposition Techniques

We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1.