• Title/Summary/Keyword: Convex Function

Search Result 446, Processing Time 0.019 seconds

GENERALIZED H$\ddot{O}$LDER ESTIMATES FOR THE $\bar{\partial}$-EQUATION ON CONVEX DOMAINS IN $\mathbb{C}^2$

  • Cho, Hong-Rae;Seo, Yeon-Seok
    • East Asian mathematical journal
    • /
    • v.25 no.2
    • /
    • pp.221-227
    • /
    • 2009
  • In this paper, we introduce the generalized H$\ddot{o}$lder space with a majorant function and prove the H$\ddot{o}$lder regularity for solutions of the Cauchy-Riemann equation in the generalized Holder spaces on a bounded convex domain in $\mathbb{C}^2$.

ON RESULTS OF MIDPOINT-TYPE INEQUALITIES FOR CONFORMABLE FRACTIONAL OPERATORS WITH TWICE-DIFFERENTIABLE FUNCTIONS

  • Fatih Hezenci;Huseyin Budak
    • Honam Mathematical Journal
    • /
    • v.45 no.2
    • /
    • pp.340-358
    • /
    • 2023
  • This article establishes an equality for the case of twice-differentiable convex functions with respect to the conformable fractional integrals. With the help of this identity, we prove sundry midpoint-type inequalities by twice-differentiable convex functions according to conformable fractional integrals. Several important inequalities are obtained by taking advantage of the convexity, the Hölder inequality, and the power mean inequality. Using the specific selection of our results, we obtain several new and well-known results in the literature.

CERTAIN SIMPSON-TYPE INEQUALITIES FOR TWICE-DIFFERENTIABLE FUNCTIONS BY CONFORMABLE FRACTIONAL INTEGRALS

  • Fatih Hezenci;Huseyin Budak
    • Korean Journal of Mathematics
    • /
    • v.31 no.2
    • /
    • pp.217-228
    • /
    • 2023
  • In this paper, an equality is established by twice-differentiable convex functions with respect to the conformable fractional integrals. Moreover, several Simpson-type inequalities are presented for the case of twice-differentiable convex functions via conformable fractional integrals by using the established equality. Furthermore, our results are provided by using special cases of obtained theorems.

CERTAIN SUBCLASS OF STRONGLY MEROMORPHIC CLOSE-TO-CONVEX FUNCTIONS

  • Gagandeep Singh;Gurcharanjit Singh; Navyodh Singh
    • Korean Journal of Mathematics
    • /
    • v.32 no.1
    • /
    • pp.73-82
    • /
    • 2024
  • The purpose of this paper is to introduce a new subclass of strongly meromorphic close-to-convex functions by subordinating to generalized Janowski function. We investigate several properties for this class such as coefficient estimates, inclusion relationship, distortion property, argument property and radius of meromorphic convexity. Various earlier known results follow as particular cases.

A GENERALIZATION OF STRONGLY CLOSE0TO-CONVEX FUNCTIONS

  • Park, Young-Ok;Lee, Suk-Young
    • Bulletin of the Korean Mathematical Society
    • /
    • v.38 no.3
    • /
    • pp.449-461
    • /
    • 2001
  • The purpose of this paper is to study several geometric properties for the new class $G_{\kappa}(\beta)$ including geometric interpretation, coefficient estimates, radius of convexity, distortion property and covering theorem.

  • PDF

SEVERAL PROPERTIES OF THE SUBCLASS OF Gk DESCRIBED BY SUBORDINATION

  • PARK, YOUNG OK
    • Honam Mathematical Journal
    • /
    • v.21 no.1
    • /
    • pp.139-147
    • /
    • 1999
  • In this paper we generalize the definition of strongly close-to-convex functions by using the functions g(z) of bounded boundary rotation and investigate the distortion and rotation theorem, coefficient inequalities, invariance property and inclusion relation for the new class $G_{k}[A,\;B]$.

  • PDF

SADDLE POINT AND GENERALIZED CONVEX DUALITY FOR MULTIOBJECTIVE PROGRAMMING

  • Yan, Zhao-Xiang;Li, Shi-Zheng
    • Journal of applied mathematics & informatics
    • /
    • v.15 no.1_2
    • /
    • pp.227-235
    • /
    • 2004
  • In this paper we consider the dual problems for multiobjective programming with generalized convex functions. We obtain the weak duality and the strong duality. At last, we give an equivalent relationship between saddle point and efficient solution in multiobjective programming.

An Efficient Polygonal Surface Reconstruction (효율적인 폴리곤 곡면 재건 알고리즘)

  • Park, Sangkun
    • Journal of Institute of Convergence Technology
    • /
    • v.10 no.1
    • /
    • pp.7-12
    • /
    • 2020
  • We describe a efficient surface reconstruction method that reconstructs a 3D manifold polygonal mesh approximately passing through a set of 3D oriented points. Our algorithm includes 3D convex hull, octree data structure, signed distance function (SDF), and marching cubes. The 3D convex hull provides us with a fast computation of SDF, octree structure allows us to compute a minimal distance for SDF, and marching cubes lead to iso-surface generation with SDF. Our approach gives us flexibility in the choice of the resolution of the reconstructed surface, and it also enables to use on low-level PCs with minimal peak memory usage. Experimenting with publicly available scan data shows that we can reconstruct a polygonal mesh from point cloud of sizes varying from 10,000 ~ 1,000,000 in about 1~60 seconds.

SUPERQUADRATIC FUNCTIONS AND REFINEMENTS OF SOME CLASSICAL INEQUALITIES

  • Banic, Senka;Pecaric, Josip;Varosanec, Sanja
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.2
    • /
    • pp.513-525
    • /
    • 2008
  • Using known properties of superquadratic functions we obtain a sequence of inequalities for superquadratic functions such as the Converse and the Reverse Jensen type inequalities, the Giaccardi and the Petrovic type inequalities and Hermite-Hadamard's inequalities. Especially, when the superquadratic function is convex at the same time, then we get refinements of classical known results for convex functions. Some other properties of superquadratic functions are also given.