凸函数的性质

文章主要研究了凸函数的连续性及可微性、相应地给一些凸函数的一般性质。

Improving cam profile design optimization based on classical splines and dynamic model

Cam profiles play an important part in the performance of cam mechanisms. Syntheses of cam profile designs and dynamics of cam designs are studied at first. Then, a cam profile design optimization model based on the six order classical spline and single DOF(degree of freedom) dynamic model of single-dwell cam mechanisms is developed. And dynamic constraints such as jumps and vibrations of followers are considered. This optimization model, with many advantages such as universalities of applications, conveniences to operations and good performances in improving kinematic and dynamic properties of cam mechanisms, is good except for the discontinuity of jerks at the end knots of cam profiles which will cause vibrations of cam systems. However, the optimization is improved by combining the six order classical spline with general polynomial spline which is the so-called "trade-offs". Finally, improved optimization is proven to have a better performance in designing cam profiles.

On Trivariate Copulas with Bivariate Linear Spearman Marginal Copulas

Based on the trivariate reduction technique two different trivariate Bernoulli mixtures of univariate uniform distributions and their associated trivariate copulas with bivariate linear Spearman marginal copulas are considered. Mathematical characterizations of these Bernoulli mixture models are obtained. Since Bernoulli mixture trivariate reduction copulas are not compatible with all valid grade correlation coefficients, and there exist linear Spearman compatible non-Bernoulli mixture trivariate copulas, one can ask when there exists at all a trivariate copula with given linear Spearman marginal copulas. Based on a known concordance ordering compatibility criterion, a set of grade correlation inequalities, which must necessarily be satisfied for compatibility, is derived. The existence question for trivariate copulas with compatible linear Spearman marginal copulas is settled in the main result, which states that this set of inequalities is also sufficient for compatibility. The constructive proof makes use of two new classes of trivariate copulas that are obtained from the Bernoulli mixture trivariate copulas through a natural parametric extension. Finally, the obtained classes of trivariate copulas are compared with another class that contains as special case some trivariate copulas with linear Spearman marginal copulas. Since the latter class is incompatible with some type of linear Spearman copulas, the new classes of trivariate copulas build a richer class in this respect. Moreover, in contrast to the mentioned class, which requires in general 11 different elementary copulas in the defining convex linear combination, the new classes require at most five of them, which results in a more parsimonious parametric modelling.

Optimality Conditions and Duality for Nondifferentiable Multiobjective Semi-Infinite Programming Problems with Generalized(C,α,ρ,d)-Convexity

This paper obtains sufficient optimality conditions for a nonlinear nondifferentiable multiobjective semi-infinite programming problem involving generalized(C,α,ρ,d)-convex functions.The authors formulate Mond-Weir-type dual model for the nonlinear nondifferentiable multiobjective semiinfinite programming problem and establish weak,strong and strict converse duality theorems relating the primal and the dual problems.

A unified approach to the weighted Grtzsch and Nitsche problems for mappings of finite distortion

This note deals with the existence and uniqueness of a minimiser of the following Grtzsch-type problem inf f ∈F∫∫_(Q_1)φ(K(z,f))λ(x)dxdyunder some mild conditions,where F denotes the set of all homeomorphims f with finite linear distortion K(z,f)between two rectangles Q_1 and Q_2 taking vertices into vertices,φ is a positive,increasing and convex function,and λ is a positive weight function.A similar problem of Nitsche-type,which concerns the minimiser of some weighted functional for mappings between two annuli,is also discussed.As by-products,our discussion gives a unified approach to some known results in the literature concerning the weighted Grtzsch and Nitsche problems.

A proximal alternating linearization method for minimizing the sum of two convex functions

In this paper, we develop a novel alternating linearization method for solving convex minimization whose objective function is the sum of two separable functions. The motivation of the paper is to extend the recent work Goldfarb et al.(2013) to cope with more generic convex minimization. For the proposed method,both the separable objective functions and the auxiliary penalty terms are linearized. Provided that the separable objective functions belong to C1,1(Rn), we prove the O(1/?) arithmetical complexity of the new method. Some preliminary numerical simulations involving image processing and compressive sensing are conducted.