Least Squares Convex-Concave Data Smoothing

We consider n noisy measurements of a smooth (unknown) function, which suggest that the graph of the function consists of one convex and one concave section. Due to the noise the sequence of the second divided differences of the data exhibits more sign changes than those expected in the second derivative of the underlying function. We address the problem of smoothing the data so as to minimize the sum of squares of residuals subject to the condition that the sequence of successive second divided differences of the smoothed values changes sign at most once. It is a nonlinear problem, since the position of the sign change is also an unknown of the optimization process. We state a characterization theorem, which shows that the smoothed values can be derived by at most 2n – 2 quadratic programming calculations to subranges of data. Then, we develop an algorithm that solves the problem in about O(n ²) computer operations by employing several techniques, including B-splines, the use of active sets, quadratic programming and updating methods. A Fortran program has been written and some of its numerical results are presented. Applications of the smoothing technique may be found in scientific, economic and engineering calculations, when a potential shape for the underlying function is an S-curve. Generally, the smoothing calculation may arise from processes that show initially increasing and then decreasing rates of change.     

A Convex Envelope Formula for Multilinear Functions

Convex envelopes of multilinear functions on a unit hypercube arepolyhedral. This well-known fact makes the convex envelopeapproximation very useful in the linearization of non-linear 0–1programming problems and in global bilinear optimization. This paperpresents necessary and sufficient conditions for a convex envelope to be apolyhedral function and illustrates how these conditions may be used inconstructing of convex envelopes. The main result of the paper is a simpleanalytical formula, which defines some faces of the convex envelope of amultilinear function. This formula proves to be a generalization of the wellknown convex envelope formula for multilinear monomial functions.     

仿紧集上的拟变分不等式

本文利用T－γ－对角凹函数和我们得到的一类极大极小不等式研究了仿紧集上的拟变分不等式．     

H-空间中新的非紧极大极小定理、截口定理及非空交定理

本文在无线性结构Ｈ－空间的框架之下给出一个新的ｖｏｎ Ｎｅｕｍａｎｎ型非紧极大极小定理，并且作为其应用而得到一个新的Ｋｙ Ｆａｎ型截口定理和一个新的非空交定理．结果即使在欧几里得空间中也是全新的     

一类凹与凸算子的推广

运用锥的性质以及单调迭代技巧给出了一类广义凹算子与凸算子正不动点的存在唯一性,并讨论了算子特征值方程的性质.作为应用,利用所获结果研究了一类积分方程正解的存在唯一性.     

非正常凸多面体及凹多面体的落地概率

通过研究非正常凸、凹多边形板着地后的特点,得出了非正常凸多边形板及凹多边形板各边着地的概率.进而用立体角的概念,在分析非正常凸、凹多面体着地的特点后,得到了非正常凸多面体及凹多面体各面着地的概率.     

基于水平集-离散元方法的球谐函数颗粒材料缓冲性能分析

在自然环境与工业领域中,颗粒材料是一种常见的缓冲材料,其中大量形态各异的非球形颗粒表现出复杂的力学特性并应用于不同工程领域。本文采用球谐函数构造不同球面度和表面凹凸特性的非规则颗粒,通过水平集方法计算球谐函数颗粒间的接触点和碰撞力,并对冲击过程中球形和凹形颗粒的缓冲性能进行离散元分析。数值结果表明,颗粒床厚度、冲击速度和颗粒形状显著影响球谐函数颗粒材料的缓冲性能。颗粒床底部的冲击力峰值随着颗粒床厚度和表面凹凸性的增加而降低,同时冲击力峰值随着冲击速度和颗粒球面度的增加而增加。与球形颗粒相比,球谐函数颗粒具有凹凸表面和多接触点特性,这有利于冲击荷载向四周扩展并提高凹形颗粒的缓冲效果。     

Existence and multiplicity results for singular quasilinear elliptic equation on unbounded domain

In this paper, we are interested in the existence and multiplicity results of solutions for the singular quasilinear elliptic problem with concave–convex nonlinearities (0.1) where is an unbounded exterior domain with smooth boundary ?Ω, 1 < p < N,0 ≤ a < (N ? p) ∕ p,λ > 0,1 < s < p < r < q = pN ∕ (N ? pd),d = a + 1 ? b,a ≤ b < a + 1. By the variational methods, we prove that problem 0.1 admits a sequence of solutions u_k under the appropriate assumptions on the weight functions H(x) and H(x). For the critical case, s = q,h(x) = | x | ^{? bq}, we obtain that problem 0.1 has at least a nonnegative solution with p < r < q and a sequence of solutions u_k with 1 < r < p < q and J(u_k) → 0 as k → ∞ , where J(u) is the energy functional associated to problem 0.1 . Copyright © 2013 John Wiley & Sons, Ltd.     

一些约束规划问题的近似全局最优解

首先将一个具有多个约束的规划问题转化为一个只有一个约束的规划问题,然后通过利用这个单约束的规划问题,对原来的多约束规划问题提出了一些凸化、凹化的方法,这样这些多约束的规划问题可以被转化为一些凹规划、反凸规划问题．最后,还证明了得到的凹规划和反凸规划的全局最优解就是原问题的近似全局最优解．