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]

Integral inequalities with generalized convexity play an important role in both applied and theoretical mathematics. The theory of integral inequalities is currently one of the most rapidly developing areas of mathematics due to its wide range of applications. In this paper, we study the concept of higher-order strongly exponentially convex functions and establish a new Hermite–Hadamard inequality for the class of strongly exponentially convex functions of higher order. Further, we derive some new integral inequalities for Riemann–Liouville fractional integrals via higher-order strongly exponentially convex functions. These findings include several well-known results and newly obtained results as special cases. We believe that the results presented in this paper are novel and will be beneficial in encouraging future research in this field. [ABSTRACT FROM AUTHOR]

In this paper, a joint study of the behavior of solutions of the Heavy Ball ODE and Heavy Ball type algorithms is given. Since the pioneering work of Polyak (USSR Comput Math Math Phys 4(5):1–17, 1964), it is well known that such a scheme is very efficient for C 2 strongly convex functions with Lipschitz gradient. But much less is known when only growth conditions are considered. Depending on the geometry of the function to minimize, convergence rates for convex functions, with some additional regularity such as quasi-strong convexity, or strong convexity, were recently obtained in Aujol et al. (Convergence rates of the Heavy-Ball method for quasi-strongly convex optimization, 2020). Convergence results with much weaker assumptions are given in the present paper: namely, linear convergence rates when assuming a growth condition (which amounts to a Łojasiewicz property in the convex case). This analysis is firstly performed in continuous time for the ODE, and then transposed for discrete optimization schemes. In particular, a variant of the Heavy Ball algorithm is proposed, which converges geometrically whatever the parameters choice, and which has the best state of the art convergence rate for first order methods to minimize composite non smooth convex functions satisfying a Łojasiewicz property. [ABSTRACT FROM AUTHOR]

We have established this paper on m convex functions, which can be expressed as a general form of the convex function concept. First of all, some inequalities of Hadamard type are proved with fairly simple conditions. Next, an integral identity containing Atangana-Baleanu fractional integral operators is obtained to prove new inequalities for differentiable m-convex functions. Using this identity, various properties of m convex functions and classical inequalities, some new integral inequalities have been proved. [ABSTRACT FROM AUTHOR]

In this paper, some sufficient conditions for the oscillation of all solutions of second order dynamic equations with a negative sub-linear neutral term are established. The obtained results provide a unified platform that adequately covers both discrete and continuous equations. Furthermore, it covers a wide range of equations by utilizing different time scales. Illustrative examples are provided. [ABSTRACT FROM AUTHOR]

In this research paper, we investigate some new identifies for Sarıkaya fractional integrals which introduced by Sarıkaya and Ertugral in [20]. The fractional integral operators also have been applied to Hermite-Hadamard type integral inequalities to provide their generalized properties. Furthermore, as special cases of our main results, we present several known inequalities such as Simpson, Bullen, trapezoid for convex functions. [ABSTRACT FROM AUTHOR]

In this paper, we study the higher-order Schwarzian derivative Sn(f) proposed by H. Tamanoi [Higher Schwarzian operators and combinatorics of the Schwarzian derivative, Math. Ann. 305 (1996), 127–151]. For the strongly starlike functions of order α and strongly convex functions of order α, the sharp bound of |S3(f)(0)| is obtained. When n ∈ [2, 7], we prove that the higher Bers maps induced by Sn(f) on Weil-Petersson Teichmüller space and BMO-Teichmüller space are holomorphic. [ABSTRACT FROM AUTHOR]

The normalization of the combination of generalized Lommel–Wright function J κ 1 , κ 2 κ 3 , m (z) (m ∈ N , κ 3 > 0 and κ 1 , κ 2 ∈ C ) defined by J κ 1 , κ 2 κ 3 , m (z) : = Γ m (κ 1 + 1) Γ (κ 1 + κ 2 + 1) 2 2 κ 1 + κ 2 z 1 − (κ 2 / 2) − κ 1 J κ 1 , κ 2 κ 3 , m (z) , where J κ 1 , κ 2 κ 3 , m (z) : = (1 − 2 κ 1 − κ 2) J κ 1 , κ 2 κ 3 , m (z) + z (J κ 1 , κ 2 κ 3 , m (z)) ′ and J κ 1 , κ 2 κ 3 , m (z) = (z 2) 2 κ 1 + κ 2 ∑ n = 0 ∞ (− 1) n Γ m (n + κ 1 + 1) Γ (n κ 3 + κ 1 + κ 2 + 1) (z 2) 2 n , was previously introduced and some of its geometric properties have been considered. In this paper, we report conditions for J κ 1 , κ 2 κ 3 , m (z) to be starlike and convex of order α, 0 ≤ α < 1 , inside the open unit disk using some technical manipulations of the gamma and digamma functions, as well as inequality for the digamma function that has been proved (Guo and Qi in Proc. Am. Math. Soc. 141(3):1007–1015, 2013). In addition, a method presented by Lorch (J. Approx. Theory 40(2):115–120 1984) and further developed by Laforgia (Math. Compet. 42(166):597–600 1984) is applied to establish firstly sharp inequalities for the shifted factorial that will be used to obtain the order of starlikeness and convexity. We compare then the obtained orders of starlikeness and convexity with some important consequences in the literature as well as the results proposed by all techniques to demonstrate the accuracy of our approach. Ultimately, a lemma by (Fejér in Acta Litt. Sci. 8:89–115 1936) is used to prove that the modified form of the function J κ 1 , κ 2 κ 3 , m (z) defined by I κ 1 , κ 2 κ 3 , m (z) = J κ 1 , κ 2 κ 3 , m (z) ∗ z / (1 + z) is in the class of starlike and convex functions, respectively. Further work regarding the function J κ 1 , κ 2 κ 3 , m (z) is underway and will be presented in a forthcoming paper. [ABSTRACT FROM AUTHOR]

We prove two key inequalities for metric and generalized projections in a certain Banach space. We then obtain some asymptotic behavior of a sequence generated by the shrinking projection method introduced by Takahashi et al. (J. Math. Anal. Appl. 341:276–286, 2008) where the computation allows some nonsummable errors. We follow the idea proposed by Kimura (Banach and Function Spaces IV (ISBFS 2012), pp. 303–311, 2014). The mappings studied in this paper are more general than the ones in (Ibaraki and Kimura in Linear Nonlinear Anal. 2:301–310, 2016; Ibaraki and Kajiba in Josai Math. Monogr. 11:105–120, 2018). In particular, the results in (Ibaraki and Kimura in Linear Nonlinear Anal. 2:301–310, 2016; Ibaraki and Kajiba in Josai Math. Monogr. 11:105–120, 2018) are both extended and supplemented. Finally, we discuss our results for finding a zero of maximal monotone operator and a minimizer of convex functions on a Banach space. [ABSTRACT FROM AUTHOR]

In this paper, we propose new first-order methods for minimization of a convex function on a simple convex set. We assume that the objective function is a composite function given as a sum of a simple convex function and a convex function with inexact Hölder-continuous subgradient. We propose Universal Intermediate Gradient Method. Our method enjoys both the universality and intermediateness properties. Following the ideas of Nesterov (Math. Program. 152 (2015), pp. 381–404) on Universal Gradient Methods, our method does not require any information about the Hölder parameter and constant and adjusts itself automatically to the local level of smoothness. On the other hand, in the spirit of the Intermediate Gradient Method proposed by Devolder et al. (CORE Discussion Paper 2013/17, 2013), our method is intermediate in the sense that it interpolates between Universal Gradient Method and Universal Fast Gradient Method. This allows to balance the rate of convergence of the method and rate of the oracle error accumulation. Under the additional assumption of strong convexity of the objective, we show how the restart technique can be used to obtain an algorithm with faster rate of convergence. [ABSTRACT FROM AUTHOR]

In this paper, we firstly establish new numerical radius inequalities which refine a result of Kittaneh in [Studia Math. 168, 73–80 (2005)], then present some numerical radius inequalities involving non-negative increasing convex functions for n × n operator matrices, which generalize the related results of Shebrawi in [Linear Algebra Appl. 523(15), 1–12 (2017)]. [ABSTRACT FROM AUTHOR]

The aim of this research work is to introduce the new concept of interval-valued intuitionistic fuzzy topological vector space(in brief IVIF-topological vector space). In this paper, the concept of IVIF-vector point, IVIF-Quasicoincidence were defined. In further, the relationship between IVIF-NQCneighbourhood, IVIF-QCneighbourhood and its bases in IVIF-topological vector space discussed. Also introduced the concept of ConvexIVIF set, Strongly ConvexIVIF set and Strictly ConvexIVIF set, in IVIF-topological vector spaces. Then it continued to the discussion about the properties and the relationship between these ConvexIVIF sets. [ABSTRACT FROM AUTHOR]

This paper provides a probabilistic proof of the comparison result for viscosity solutions of path-dependent semilinear PDEs. We consider the notion of viscosity solutions introduced in [I. Ekren, et al., Ann. Probab., 42 (2014), pp. 204-236], which considers as test functions all those smooth processes which are tangent in mean. When restricted to the Markovian case, this definition induces a larger set of test functions and reduces to the notion of stochastic viscosity solutions analyzed in [E. Bayraktar and M. Sirbu, Proc. Amer. Math. Soc., 140 (2012), pp. 3645-3654; SIAM J. Control Optim., 51 (2013), pp. 4274-4294]. Our main result takes advantage of this enlargement of the test functions and provides an easier proof of comparison. This is most remarkable in the context of the linear path-dependent heat equation. As a key ingredient for our methodology, we introduce a notion of punctual differentiation, similar to the corresponding concept in the standard viscosity solutions [L. A. Caffarelli and X. Cabre, Amer. Math. Soc. Colloq. Publ., 43, AMS, Providence, RI, 1995], and we prove that semimartingales are almost everywhere punctually differentiable. This smoothness result can be viewed as the counterpart of the Aleksandroff smoothness result for convex functions. A similar comparison result was established earlier in [I. Ekren et al., Ann. Probab., 42 (2014), pp. 204-236]. The result of this paper is more general and, more importantly, the arguments that we develop do not rely on any representation of the solution. [ABSTRACT FROM AUTHOR]

In this paper, we establish inequalities of Hermite–Hadamard type for harmonically convex functions using a generalized fractional integral. The results of our paper are an extension of previously obtained results (İşcan in Hacet. J. Math. Stat. 43(6):935–942, 2014 and İşcan and Wu in Appl. Math. Comput. 238:237–244, 2014). We also discuss some special cases for our main results and obtain new inequalities of Hermite–Hadamard type. [ABSTRACT FROM AUTHOR]

Let n ≥ 3 , Ω be a bounded (semi-)convex domain in ℝ n and the non-negative potential V belong to the reverse Hölder class RH n (ℝ n). Assume that p ∈ (1 , ∞) and ω ∈ A p (∂ Ω) , where A p (∂ Ω) denotes the Muckenhoupt weight class on ∂ Ω , the boundary of Ω. In this paper, the authors show that, for any p ∈ (1 , ∞) , the Neumann problem for the Schrödinger equation − Δ u + V u = 0 in Ω with boundary data in (weighted) L p is uniquely solvable. The obtained results in this paper essentially improve the known results which are special cases of the results obtained by Shen [Indiana Univ. Math. J.43 (1994) 143–176] and Tao and Wang [Canad. J. Math.56 (2004) 655–672], via extending the range p ∈ (1 , 2 ] of p into p ∈ (1 , ∞). [ABSTRACT FROM AUTHOR]

This paper provides a probabilistic proof of the comparison result for viscosity solutions of path-dependent semilinear PDEs. We consider the notion of viscosity solutions introduced in [I. Ekren, et al., Ann. Probab., 42 (2014), pp. 204-236], which considers as test functions all those smooth processes which are tangent in mean. When restricted to the Markovian case, this definition induces a larger set of test functions and reduces to the notion of stochastic viscosity solutions analyzed in [E. Bayraktar and M. Sirbu, Proc. Amer. Math. Soc., 140 (2012), pp. 3645-3654; SIAM J. Control Optim., 51 (2013), pp. 4274-4294]. Our main result takes advantage of this enlargement of the test functions and provides an easier proof of comparison. This is most remarkable in the context of the linear path-dependent heat equation. As a key ingredient for our methodology, we introduce a notion of punctual differentiation, similar to the corresponding concept in the standard viscosity solutions [L. A. Caffarelli and X. Cabre, Amer. Math. Soc. Colloq. Publ., 43, AMS, Providence, RI, 1995], and we prove that semimartingales are almost everywhere punctually differentiable. This smoothness result can be viewed as the counterpart of the Aleksandroff smoothness result for convex functions. A similar comparison result was established earlier in [I. Ekren et al., Ann. Probab., 42 (2014), pp. 204-236]. The result of this paper is more general and, more importantly, the arguments that we develop do not rely on any representation of the solution. [ABSTRACT FROM AUTHOR]

In this paper we establish some natural consequences of the Wirtinger integral inequality. Applications related to the trapezoid unweighted and weighted inequalities, of Fej'er's inequality for convex functions and of Gr¨uss' type inequalities are also provided. [ABSTRACT FROM AUTHOR]

Convex functions play an important role in many areas of mathematics. They are especially important in the study of optimization problems where they are distinguished by a number of convenient properties. In this paper, firstly we introduce the notion of h -exponential convex functions. This notion can be considered as generalizations of many existing definitions of convex functions. Then, we establish some well-known inequalities for the proposed notion via incomplete gamma functions. Precisely speaking, we established trapezoidal, midpoint, and He's inequalities for h -exponential and harmonically exponential convex functions via incomplete gamma functions. Moreover, we gave several remarks to prove that our results are more generalized than the existing results in the literature. [ABSTRACT FROM AUTHOR]

In the present paper, we analyze a class of convex semi-infinite programming problems with arbitrary index sets defined by a finite number of nonlinear inequalities. The analysis is carried out by employing the constructive approach, which, in turn, relies on the notions of immobile indices and their immobility orders. Our previous work showcasing this approach includes a number of papers dealing with simpler cases of semi-infinite problems than the ones under consideration here. Key findings of the paper include the formulation and the proof of implicit and explicit optimality conditions under assumptions, which are less restrictive than the constraint qualifications traditionally used. In this perspective, the optimality conditions in question are also compared to those provided in the relevant literature. Finally, the way to formulate the obtained optimality conditions is demonstrated by applying the results of the paper to some special cases of the convex semi-infinite problems. [ABSTRACT FROM AUTHOR]

In this paper, we proved two new Riemann–Liouville fractional Hermite–Hadamard type inequalities for harmonically convex functions using the left and right fractional integrals independently. Also, we have two new Riemann–Liouville fractional trapezoidal type identities for differentiable functions. Using these identities, we obtained some new trapezoidal type inequalities for harmonically convex functions. Our results generalize the results given by İşcan (Hacet J Math Stat 46(6):935–942, 2014). [ABSTRACT FROM AUTHOR]

This paper is concerned with strictly k-convex large solutions to Hessian equations Sk(D2u(x)) = b(x)f(u(x)), x ∈ Ω, where Ω is a strictly (k − 1)-convex and bounded smooth domain in ℝn, b ∈ C ∞ ( Ω ¯) is positive in Ω, but may be vanishing on the boundary. Under a new structure condition on f at infinity, the author studies the refined boundary behavior of such solutions. The results are obtained in a more general setting than those in [Huang, Y., Boundary asymptotical behavior of large solutions to Hessian equations, Pacific J. Math., 244, 2010, 85–98], where f is regularly varying at infinity with index p > k. [ABSTRACT FROM AUTHOR]

In previous work (Alves et al. in Z Angew Math Phys 69:106, 2018), by using the linear semigroup theory, Alves et al. investigated the existence and exponential stability results for a Moore–Gibson–Thompson model encompassing memory of type 1, 2 or 3 in a history space framework. In this paper, we continue to consider the similar problem with type 1 and establish explicit and general decay results of energy for system in both the subcritical and critical cases, by introducing suitable energy and perturbed Lyapunov functionals and following convex functions ideas presented in Guesmia (J Math Anal Appl 382:748–760, 2011). Our results allow a much larger class of the convolution kernels which improves the earlier related results. [ABSTRACT FROM AUTHOR]

Given a closed convex set A in a Banach space X, this paper considers the continuity and differentiability of A. The continuity of a closed convex set was introduced and studied by Gale and Klee [Math. Scand., 7 (1959), pp. 370--391] in terms of its support functional, and the differentiability of a closed convex set is a new notion introduced again in terms of its support functional. Using the technique of variational analysis, we prove that A is differentiable if and only if for every continuous linear (or convex) function f : X → R bounded below on A the corresponding optimization problem infxεA f(x) is well-posed solvable. In the reflexive space case, we prove that A is continuous if and only if for every continuous linear (or convex) function f : X → R bounded below on A the corresponding optimization problem infxεAf(x) is weakly well-posed solvable. We also prove that if the conjugate function f* of a given continuous convex function f on X is Fréchet differentiable (resp., continuous) on dom(f*), then for every closed convex set K in X with infxεKf(x) > - ∞ the corresponding optimization problem with objective f and constraint set K is well-posed (resp., weakly well-posed) solvable. In the framework of finite-dimensional spaces, several sharper results are established. [ABSTRACT FROM AUTHOR]

In this paper we consider a class of structured nonsmooth difference-of-convex (DC) minimization in which the first convex component is the sum of a smooth and nonsmooth functions while the second convex component is the supremum of possibly infinitely many convex smooth functions. We first propose an inexact enhanced DC algorithm for solving this problem in which the second convex component is the supremum of finitely many convex smooth functions, and show that every accumulation point of the generated sequence is an (α , η) -D-stationary point of the problem, which is generally stronger than an ordinary D-stationary point. In addition, inspired by the recent work (Pang et al. in Math Oper Res 42(1):95–118, 2017; Wen et al. in Comput Optim Appl 69(2):297–324, 2018), we propose two proximal DC algorithms with extrapolation for solving this problem. We show that every accumulation point of the solution sequence generated by them is an (α , η) -D-stationary point of the problem, and establish the convergence of the entire sequence under some suitable assumption. We also introduce a concept of approximate (α , η) -D-stationary point and derive iteration complexity of the proposed algorithms for finding an approximate (α , η) -D-stationary point. In contrast with the DC algorithm (Pang et al. 2017), our proximal DC algorithms have much simpler subproblems and also incorporate the extrapolation for possible acceleration. Moreover, one of our proximal DC algorithms is potentially applicable to the DC problem in which the second convex component is the supremum of infinitely many convex smooth functions. In addition, our algorithms have stronger convergence results than the proximal DC algorithm in Wen et al. (2018). [ABSTRACT FROM AUTHOR]

In a very recent work, Şeker and Sümer Eker [On subclasses of bi-close-to-convex functions related to the odd-starlike functions. Palestine Journal of Mathematics 2017; 6: 215-221] defined two subclasses of analytic bi-closeto- convex functions related to the odd-starlike functions in the open unit disk U. The main purpose of this paper is to generalize and improve the results of Şeker and Sümer Eker (in the aforementioned study) defining a comprehensive subclass of bi-close-to-convex functions. Also, we investigate the Fekete-Szegö type coefficient bounds for functions belonging to this new class. [ABSTRACT FROM AUTHOR]

We characterize the subdifferential of the supremum function of finitely and infinitely indexed families of convex functions. The main contribution of this paper consists of providing formulas for such a subdifferential under weak continuity assumptions. The resulting formulas are given in terms of the exact subdifferential of the data functions at the reference point, and not at nearby points as in [Valadier, C. R. Math. Acad. Sci. Paris, 268 (1969), pp. 39--42]. We also derive new Fritz John- and KKT-type optimality conditions for semi-infinite convex optimization, omitting the continuity/closedness assumptions in [Dinh et al., ESAIM Control Optim. Calc. Var., 13 (2007), pp. 580--597]. When the family of functions is finite, we use continuity conditions concerning only the active functions, and not all the data functions as in [Rockafellar, Proc. Lond. Math. Soc. (3), 39 (1979), pp. 331--355; Volle, Acta Math. Vietnam., 19 (1994), pp. 137--148]. [ABSTRACT FROM AUTHOR]

In this paper we derive the famous Fekete-Szegö inequality for the class of p-valent non-bazilevič function using differential operator. [ABSTRACT FROM AUTHOR]

In the paper we discuss two functionals of the Fekete-Szegö type: Φf(µ) = a2a4 -- µ,a3² and ©/(µ) = a4 -- µa2a3 for an analytic function f (z) = z + a2z² + a3z³ + . . ., z € Δ, (Δ = {z € C : |z| < 1}) and a real number µ. We focus our research on the estimation of (µ)| and \©f (µ)|, while f is either in S* (the class of starlike functions) or in Κ (the class of convex functions). [ABSTRACT FROM AUTHOR]

In this paper, it is proved that fractional Hermite-Hadamard inequality and fractional Hermite-Hadamard-Fejér inequality are just results of Hermite-Hadamard-Fejer inequality. After this, a new fractional Hermite-Hadamard inequality which is not a result of Hermite-Hadamard- Fejer inequality and better than given in [9] by Sarıkaya et al. is obtained. Also, a new equality is proved and some new fractional midpoint type inequalities are given. Our results generalizes the results given in [5] by Kırmacı. [ABSTRACT FROM AUTHOR]

Recently in the paper [Mediterr. J. Math. 2016, 13, 1535–1553], the authors introduced and studied a new operator which was defined as a convolution of the three popular linear operators, namely the Sǎlǎgean operator, the Ruscheweyh operator and a fractional derivative operator. In the present paper, we consider an operator which is a convolution operator of only two linear operators (with lesser restricted parameters) that yield various well-known operators, defined by a symmetric way, including the one studied in the above-mentioned paper. Several results on the subordination of analytic functions to this operator (defined below) are investigated. Some of the results presented are shown to involve the familiar Appell function and Hurwitz–Lerch Zeta function. Special cases and interesting consequences being in symmetry of our main results are also mentioned. [ABSTRACT FROM AUTHOR]

We analyze the convergence rate of the alternating direction method of multipliers (ADMM) for minimizing the sum of two or more nonsmooth convex separable functions subject to linear constraints. Previous analysis of the ADMM typically assumes that the objective function is the sum of only two convex functions defined on two separable blocks of variables even though the algorithm works well in numerical experiments for three or more blocks. Moreover, there has been no rate of convergence analysis for the ADMM without strong convexity in the objective function. In this paper we establish the global R-linear convergence of the ADMM for minimizing the sum of any number of convex separable functions, assuming that a certain error bound condition holds true and the dual stepsize is sufficiently small. Such an error bound condition is satisfied for example when the feasible set is a compact polyhedron and the objective function consists of a smooth strictly convex function composed with a linear mapping, and a nonsmooth $$\ell _1$$ regularizer. This result implies the linear convergence of the ADMM for contemporary applications such as LASSO without assuming strong convexity of the objective function. [ABSTRACT FROM AUTHOR]

In this paper we present some new operator inequality for convex functions. We have obtained a number of Jensen's type inequalities for convex and operator convex functions of self-adjoint operators for positive linear maps. Some results are exemplified for power and logarithmic functions. [ABSTRACT FROM AUTHOR]

In this paper, is defined the operator Dλ,ν,nα,β : A → A, given by Dλ,ν,nα,β f(z) = (1 - α - β)RνDnf(z) + αRνΩλzf(z) + βDnΩλzf(z), for z ∈ U, where Rν is the Ruscheweyh derivative, Dn is the Sălăgean operator, Ωλz is a fractional differintegral operator introduced by S. Owa and H. M. Srivastava, A = {f ∈ H(U) : f(z) = z + a2z² + a3z³ + ..., z ∈ U}, α, β ≥ 0, ν > -1, n ∈ N0 = {0, 1, 2, 3, ...}, -∞ < λ < 2. A certain subclass of analytic functions in the open unit disk, Rλ,ν,nα,β (δ), where 0 ≤ δ ≤ 1, is introduced using the new operator. Are obtained some properties of the class Rλ,ν,nα,β (δ) and some differential subordinations using the operator Dλ,ν,nα,β. [ABSTRACT FROM AUTHOR]

In the present paper, we investigate upper bounds on the third Hankel determinants for the starlike and convex functions with respect to symmetric points in the open unit disk. [ABSTRACT FROM AUTHOR]

In this paper, the Hager and Zhang (HZ) conjugate gradient (CG) method and the modified HZ (MHZ) CG method are presented for large-scale nonsmooth convex minimization. Under some mild conditions, convergent results of the proposed methods are established. Numerical results show that the presented methods can be better efficiency for large-scale nonsmooth problems, and several problems are tested (with the maximum dimensions to 100,000 variables). [ABSTRACT FROM AUTHOR]

We present in this paper two different classes of general multiple-splitting algorithms for solving finite-dimensional convex optimization problems. Under the assumption that the function being minimized can be written as the sum of K convex functions, each of which has a Lipschitz continuous gradient, we prove that the number of iterations needed by the first class of algorithms to obtain an ε-optimal solution is O((K - 1)L/ε), where L is an upper bound on all of the Lipschitz constants. The algorithms in the second class are accelerated versions of those in the first class, where the complexity result is improved to O(√(K - 1)L/ε) while the computational effort required at each iteration is almost unchanged. To the best of our knowledge, the complexity results presented in this paper are the first ones of this type that have been given for splitting and alternating direction-type methods. Moreover, all algorithms proposed in this paper are parallelizable, which makes them particularly attractive for solving certain large-scale problems. [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]

This paper considers an annular circular cylinder, consisting of homogeneous isotropic linear elastic material, in a state of axisymmetric (torsionless) stress corresponding to traction-free lateral boundaries and such that the traction on every cross-section is self-equilibrated, body forces being absent; in the main case considered, one plane end is traction-free, the other being self-equilibrated. A positive-definite cross-sectional measure of stress is defined and shown to be a convex function of the axial coordinate, and, in the main case considered, to be a function of "generalized convexity". Inferences are drawn, including a spatial decay estimate for a semi-infinite cylinder reflecting Saint-Venant's principle. The paper concludes with a discussion of the estimate obtained. [ABSTRACT FROM AUTHOR]

In this paper we will first give a positive answer to Kaiser's conjecture on ε -positive centers for convex curves and then present its two applications. [ABSTRACT FROM AUTHOR]

We study semi-convex frontier (SCF) optimization problems where objective functions can be semi-convex and constraint sets can be non-polyhedron, which stem from a growing range of optimization applications such as frontier analysis, multi-objective programming in economics. The new findings of this paper can be summarized as follows: (1) We characterize non-dominated points of a non-polyhedron optimal solution set of a semi-convex frontier program. (2) We obtain optimality conditions of a constant modulus SCF program, of which the objective function is semi-convex with a constant semiconvexity modulus. (3) We obtain a non-smooth Hölder stability of the optimal solutions of a semiconvex frontier program. (4) We use generalized differentiability to establish sensitivity analysis of the optimal value function of a semi-convex frontier program. [ABSTRACT FROM AUTHOR]

The main purpose of the article is to introduce an active teaching method, based on the nature of a familiar mathematical concept. Specifically, this paper presents the application of the visual image of convex function and concave function graphs concave function on demonstrating some inequality in the primary curriculum. Also, some results and comments concerning the proving method of such as inequalities are stated. [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 we investigate continuity properties of functions $${f : \mathbb {R}_+ \to \mathbb {R}_+}$$ that satisfy the ( p, q)-Jensen convexity inequality where H stands for the pth power (or Hölder) mean. One of the main results shows that there exist discontinuous multiplicative functions that are ( p, p)-Jensen convex for all positive rational numbers p. A counterpart of this result states that if f is ( p, p)-Jensen convex for all $${p \in P \subseteq \mathbb {R}_+}$$ , where P is a set of positive Lebesgue measure, then f must be continuous. [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]

In this paper, we consider a new class 풞(ϕ, ψ, η) of analytic functions defined by means of subordination. Coefficient bounds, Fekete-Szegö problem and norm estimates of the pre-Schwarzian derivatives of functions belonging to the class 풞(ϕ, ψ, η) are investigated. A class of multiple close-to-convex functions is also considered. [ABSTRACT FROM AUTHOR]

Abstract: The operator involved in quasiconvex functions is and this also arises as the governing operator in a worst case tug-of-war (Kohn and Serfaty (2006) [7]) and principal curvature of a surface. In Barron et al. (2012) [4] a comparison principle for was proved. A new and much simpler proof is presented in this paper based on Barles and Busca (2001) [3] and Lu and Wang (2008) [8]. Since is the minimal principal curvature of a surface, we show by example that does not have a unique solution, even if . Finally, we complete the identification of first order evolution problems giving the convex envelope of a given function. [Copyright &y& Elsevier]

The theory of convexity has a rich and paramount history and has been the interest of intense research for longer than a century in mathematics. It has not just fascinating and profound outcomes in different branches of engineering and mathematical sciences, it also has plenty of uses because of its geometrical interpretation and definition. It also provides numerical quadrature rules and tools for researchers to tackle and solve a wide class of related and unrelated problems. The main focus of this paper is to introduce and explore the concept of a new family of convex functions namely generalized exponential type m -convex functions. Further, to upgrade its numerical significance, we present some of its algebraic properties. Using the newly introduced definition, we investigate the novel version of Hermite–Hadamard type integral inequality. Furthermore, we establish some integral identities, and employing these identities, we present several new Hermite–Hadamard H–H type integral inequalities for generalized exponential type m -convex functions. These new results yield some generalizations of the prior results in the literature. [ABSTRACT FROM AUTHOR]

In this paper we present a refinement of inequality: ΣsinA/2≥5/4+r/2R who are true in any acute triangle ABC and some consequences of DRIMBE inequality. [ABSTRACT FROM AUTHOR]