关于凸曲面的几个定义的关系

本文讨论了凸曲面的几种定义及其关系，发现有的定义是局部凸的定义，有的是整体凸的定义，有的则对于局部凸和整体凸都适合，最后给出了各种定义之间互推的证明，对于局部凸和整体凸定义之间不能推证的，则说明了原因．     

Robust handling of non‐linear constraints for GA optimization of aerodynamic shapes

A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd.     

激光限制结晶技术制备nc-Si/SiO2多层膜

在等离子体增强化学气相淀积系统中，采用aSi:H层淀积和原位等离子体氧化相结合的逐层生长技术制备了aSi:H/SiO_2多层膜.在激光诱导限制结晶原理基础上，使用KrF准分子脉冲激光为辐照源，对aSi:H/SiO_2多层膜进行辐照，使纳米级厚度的aSi:H子层晶化.Raman散射谱和电子衍射谱的结果表明，经过激光辐照后纳米Si颗粒在原始的aSi:H子层内形成，晶粒尺寸可以根据aSi:H层的厚度精确控制.还研究了样品的光致发光（PL）特性以及激光辐照能量密度对PL性质的影响. 关键词： 脉冲激光 多层膜 限制结晶     

Cyclic Hypomonotonicity,Cyclic Submonotonicity,and Integration

Rockafellar has shown that the subdifferentials of convex functions are always cyclically monotone operators. Moreover, maximal cyclically monotone operators are necessarily operators of this type, since one can construct explicitly a convex function, which turns out to be unique up to a constant, whose subdifferential gives back the operator. This result is a cornerstone in convex analysis and relates tightly convexity and monotonicity. In this paper, we establish analogous robust results that relate weak convexity notions to corresponding notions of weak monotonicity, provided one deals with locally Lipschitz functions and locally bounded operators. In particular, the subdifferentials of locally Lipschitz functions that are directionally hypomonotone [respectively, directionally submonotone] enjoy also an additional cyclic strengthening of this notion and in fact are maximal under this new property. Moreover, every maximal cyclically hypomonotone [respectively, maximal cyclically submonotone] operator is always the Clarke subdifferential of some directionally weakly convex [respectively, directionally approximately convex] locally Lipschitz function, unique up to a constant, which in finite dimentions is a lower C² function [respectively, a lower C¹ function].     

Generic Well-Posedness of Constrained Variational Problems Without Convexity Assumptions

In our previous work, a generic well-posedness result (with respect to variations of the integrand of the integral functional) without the convexity condition was established for a class of optimal control problems satisfying the Cesari growth condition. In this paper, we extend this generic well-posedness result to classes of constrained variational problems in which the values at the endpoints and constraint maps are also subject to variations.     

Augmented Lagrangian Algorithms Based on the Spectral Projected Gradient Method for Solving Nonlinear Programming Problems

The spectral projected gradient method SPG is an algorithm for large-scale bound-constrained optimization introduced recently by Birgin, Martínez, and Raydan. It is based on the Raydan unconstrained generalization of the Barzilai-Borwein method for quadratics. The SPG algorithm turned out to be surprisingly effective for solving many large-scale minimization problems with box constraints. Therefore, it is natural to test its perfomance for solving the sub-problems that appear in nonlinear programming methods based on augmented Lagrangians. In this work, augmented Lagrangian methods which use SPG as the underlying convex-constraint solver are introduced (ALSPG) and the methods are tested in two sets of problems. First, a meaningful subset of large-scale nonlinearly constrained problems of the CUTE collection is solved and compared with the perfomance of LANCELOT. Second, a family of location problems in the minimax formulation is solved against the package FFSQP.     

On the Existence of Solutions to Vector Quasivariational Inequalities and Quasicomplementarity Problems with Applications Break to Traffic Network Equilibria

For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions.     

Conjugacy relationship between M-convex and L-convex functions in continuous variables

By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan     

Elliptic and parabolic problems in unbounded domains

We consider elliptic and parabolic problems in unbounded domains. We give general existence and regularity results in Besov spaces and semi‐explicit representation formulas via operator‐valued fundamental solutions which turn out to be a powerful tool to derive a series of qualitative results about the solutions. We give a sample of possible applications including asymptotic behavior in the large, singular perturbations, exact boundary conditions on artificial boundaries and validity of maximum principles. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Multilevel a posteriori error analysis for reaction–convection–diffusion problems

We present a new approach to the a posteriori error analysis of stable Galerkin approximations of reaction–convection–diffusion problems. It relies upon a non-standard variational formulation of the exact problem, based on the anisotropic wavelet decomposition of the equation residual into convection-dominated scales and diffusion-dominated scales. The associated norm, which is stronger than the standard energy norm, provides a robust (i.e., uniform in the convection limit) control over the streamline derivative of the solution. We propose an upper estimator and a lower estimator of the error, in this norm, between the exact solution and any finite dimensional approximation of it. We investigate the behaviour of such estimators, both theoretically and through numerical experiments. As an output of our analysis, we find that the lower estimator is quantitatively accurate and robust.