Search

In this note, we slightly generalize Theorem 2 in the paper by M. Tunç and point out that the assumption of Theorem 3 is not sufficient. A misuse of the term 'mean' is also discussed. [ABSTRACT FROM AUTHOR]

The aim of this note is to analyse the results in the paper by D.Y. Gao and G. Strang [Geometric nonlinearity: Potential energy, complementary energy, and the gap function, Quart. Appl. Math. 47 (1989), pp. 487-504] where, according to D.Y. Gao, the complementary gap function was first introduced, and several flaws, mistakes, and inconsistencies are present, and to discuss the mathematical manner in which the mentioned paper presents itself, especially from the point of view of convex analysis. [ABSTRACT FROM AUTHOR]

In the paper, the authors establish some new inequalities of Simpson type for functions whose third derivatives are extended s-convex functions, and apply these inequalities to derive some inequalities of special means. [ABSTRACT FROM AUTHOR]

In this paper, some refinements of Hermite-Hadamard type inequalities for GA-convex functions are obtained. Applications of the obtained results to special means are given. [ABSTRACT FROM AUTHOR]

Abstract: The aim of this note is to give an alternative proof for a recent result due to Dorsch et al., which provides an upper estimate for the Clarke subdifferential of an infimal value function. We show the validity of this result under a weaker condition than the one assumed in the aforementioned paper, while the use of the Mordukhovich subdifferential, as an intermediate step, will considerably shorten its proof. [Copyright &y& Elsevier]

Hubert, Mauduit and Sárközy introduced the pseudorandom measure of order ℓ of binary lattices. This measure studies the pseudorandomness only on box lattices of very special type. In certain applications one may need measures covering a more general situation. In this paper the line measure and the convex measure are introduced. [ABSTRACT FROM AUTHOR]

The object of the present paper is to investigate several classes of analytic functions with varying argument of coefficients, which are defined here by means of the principle of subordination between analytic functions. Such properties as the coefficient estimates, distortion theorems, subordination theorems, convolution properties, integral means inequalities, and radii of conexity and starlikenes are investigated. Some consequences of our main results for new or known classes of analytic functions are also pointed out. [ABSTRACT FROM AUTHOR]

In this paper a new hybrid conjugate gradient algorithm is proposed and analyzed. The parameter β k is computed as a convex combination of the Polak-Ribière-Polyak and the Dai-Yuan conjugate gradient algorithms, i.e. β=(1− θ k) β+ θ k β. The parameter θ k in the convex combination is computed in such a way that the conjugacy condition is satisfied, independently of the line search. The line search uses the standard Wolfe conditions. The algorithm generates descent directions and when the iterates jam the directions satisfy the sufficient descent condition. Numerical comparisons with conjugate gradient algorithms using a set of 750 unconstrained optimization problems, some of them from the CUTE library, show that this hybrid computational scheme outperforms the known hybrid conjugate gradient algorithms. [ABSTRACT FROM AUTHOR]

The notion of extended-well-posedness has been introduced by Zolezzi for scalar minimization problems and has been further generalized to vector minimization problems by Huang. In this paper, we study the extended well-posedness properties of vector minimization problems in which the objective function is C-quasiconvex. To achieve this task, we first study some stability properties of such problems. [ABSTRACT FROM AUTHOR]

Abstract: In the present paper, we give a growth theorem of Bazilevič functions of type (α, β). [Copyright &y& Elsevier]

Abstract: In this paper, alternative proofs are provided for monotonic and logarithmically convex properties of the one-parameter mean values and for monotonic properties of the product on . [Copyright &y& Elsevier]

The question of determining strong convex underestimators for nonlinear functions is theoretically and practically of major interest. Unfortunately, results along these lines are quite limited as very few general procedures are at hand that can be applied to general classes of functions. In this paper we show how to reduce the question of determining a convex envelope to lower-dimensional optimization problems when the underlying function is indefinite and (n-1)-convex. Our structural result about this reduction technique enables us to give descriptions for the convex envelope of a variety of two-dimensional functions. [ABSTRACT FROM AUTHOR]

Let Ap denote the class of functions of the form f (z) = zp+ap+1 zp+1+a p+2zp+2+…which are regular and p-valent in the open unit disc D = {z : |z| < 1}. Let Mp(α) be the subclass of Ap consisting of functions f(z) which satisfy Re (z f′ (z)/ f(z) < α, (z ε D) for some real α (α > 1). The aim of this paper is to give a representation theorem, a distortion theorem and a coefficient inequality for the class Mp(α). [ABSTRACT FROM AUTHOR]

Abstract: The main object of the present paper is to investigate α-convex and α-quasiconvex functions with respect to n-symmetric points. Some interesting properties such as inclusion relationships, integral representations, convolution conditions are obtained. [Copyright &y& Elsevier]

We consider a convexification method for a class of nonsmooth monotone functions. Specifically, we prove that a semismooth monotone function can be converted into a convex function via certain convexification transformations. The results derived in this paper lay a theoretical base to extend the reach of convexification methods in monotone optimization to nonsmooth situations. [ABSTRACT FROM AUTHOR]

The trust region subproblem plays an important role in optimization and numerical analysis. Many researchers even use it in regularizing ill-posed problems. It appears that the trust region subproblem is ill-posed: the set of solutions is unstable with respect to the data in the functional to be minimized, that is a small error in the functional to be minimized might cause large errors in the set of solutions. The aim of the paper is to study the ill-posed nature of the problem and to suggest methods to overcome the ill-posedness. The methods are mainly based on Tikhonov regularization with the generalized discrepancy principle suggested by Goncharskii, Leonov, and Yagola and the difference of convex functions algorithm (DCA) recently developed by Plant Dinh Tao and Le Thi Hoai An. The open problem of Tikhonov regularization methods for non-linear ill-posed problems how to globally solve non-linear (in general non-convex) optimization problems occurred from them is completely answered for the trust region subproblem by DCA. Several test numerical examples are outlined. [ABSTRACT FROM AUTHOR]

In this paper, we present numerous sets of nonparametric sufficient optimality conditions and duality results under various generalized (F ϱ, θ)-convexity assumptions for a minmax fractional subset programming problem. [Copyright &y& Elsevier]