Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

On some Hermite-Hadamard type inequalities for (s, QC)-convex functions.

ABSTRACT: In the paper, the authors introduce a new notion "[Formula: see text]-convex function on the co-ordinates" and establish some Hermite-Hadamard type integral inequalities for [Formula: see text]-convex functions on the co-ordinates.

SUBMITTER: Wu Y

PROVIDER: S-EPMC4718919 | biostudies-other | 2016

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Publications

On some Hermite-Hadamard type inequalities for (s, QC)-convex functions.

Wu Ying Y Qi Feng F

SpringerPlus 20160120

In the paper, the authors introduce a new notion "[Formula: see text]-convex function on the co-ordinates" and establish some Hermite-Hadamard type integral inequalities for [Formula: see text]-convex functions on the co-ordinates. ...[more]

PMID: 26835229

Similar Datasets

Generalizations on some Hermite-Hadamard type inequalities for differentiable convex functions with applications to weighted means.

Project description:Some new Hermite-Hadamard type inequalities for differentiable convex functions were presented by Xi and Qi. In this paper, we present new generalizations on the Xi-Qi inequalities.

| S-EPMC3914595 | biostudies-other

Generalized Hermite-Hadamard type inequalities involving fractional integral operators.

Project description:In this article, a new general integral identity involving generalized fractional integral operators is established. With the help of this identity new Hermite-Hadamard type inequalities are obtained for functions whose absolute values of derivatives are convex. As a consequence, the main results of this paper generalize the existing Hermite-Hadamard type inequalities involving the Riemann-Liouville fractional integral.

| S-EPMC5517584 | biostudies-other

Quasi-Herglotz functions and convex optimization.

Project description:We introduce the set of quasi-Herglotz functions and demonstrate that it has properties useful in the modelling of non-passive systems. The linear space of quasi-Herglotz functions constitutes a natural extension of the convex cone of Herglotz functions. It consists of differences of Herglotz functions and we show that several of the important properties and modelling perspectives are inherited by the new set of quasi-Herglotz functions. In particular, this applies to their integral representations, the associated integral identities or sum rules (with adequate additional assumptions), their boundary values on the real axis and the associated approximation theory. Numerical examples are included to demonstrate the modelling of a non-passive gain medium formulated as a convex optimization problem, where the generating measure is modelled by using a finite expansion of B-splines and point masses.

| S-EPMC7029951 | biostudies-literature

On a subclass of meromorphic close-to-convex functions.

Project description:The main purpose of this paper is to introduce and investigate a certain subclass of meromorphic close-to-convex functions. Such results as coefficient inequalities, convolution property, inclusion relationship, distortion property, and radius of meromorphic convexity are derived.

| S-EPMC4163370 | biostudies-other

Algebraic signatures of convex and non-convex codes.

Project description:A convex code is a binary code generated by the pattern of intersections of a collection of open convex sets in some Euclidean space. Convex codes are relevant to neuroscience as they arise from the activity of neurons that have convex receptive fields. In this paper, we use algebraic methods to determine if a code is convex. Specifically, we use the neural ideal of a code, which is a generalization of the Stanley-Reisner ideal. Using the neural ideal together with its standard generating set, the canonical form, we provide algebraic signatures of certain families of codes that are non-convex. We connect these signatures to the precise conditions on the arrangement of sets that prevent the codes from being convex. Finally, we also provide algebraic signatures for some families of codes that are convex, including the class of intersection-complete codes. These results allow us to detect convexity and non-convexity in a variety of situations, and point to some interesting open questions.

| S-EPMC6750060 | biostudies-literature

Coefficient bounds for some families of starlike and convex functions of reciprocal order.

Project description:The aim of the present paper is to investigate coefficient estimates, Fekete-Szegő inequality, and upper bound of third Hankel determinant for some families of starlike and convex functions of reciprocal order.

| S-EPMC4260375 | biostudies-other

Time-resolved crystallography using the Hadamard transform.

Project description:We describe a method for performing time-resolved X-ray crystallographic experiments based on the Hadamard transform, in which time resolution is defined by the underlying periodicity of the probe pulse sequence, and signal/noise is greatly improved over that for the fastest pump-probe experiments depending on a single pulse. This approach should be applicable on standard synchrotron beamlines and will enable high-resolution measurements of protein and small-molecule structural dynamics. It is also applicable to other time-resolved measurements where a probe can be encoded, such as pump-probe spectroscopy.

| S-EPMC4216935 | biostudies-literature

Coefficient inequalities for a subclass of p-valent analytic functions.

Project description:The aim of this paper is to study the problem of coefficient bounds for a newly defined subclass of p-valent analytic functions. Many known results appear as special consequences of our work.

| S-EPMC3932209 | biostudies-other

The modified proximal point algorithm in Hadamard spaces.

Project description:The purpose of this paper is to propose a modified proximal point algorithm for solving minimization problems in Hadamard spaces. We then prove that the sequence generated by the algorithm converges strongly (convergence in metric) to a minimizer of convex objective functions. The results extend several results in Hilbert spaces, Hadamard manifolds and non-positive curvature metric spaces.

| S-EPMC5968084 | biostudies-literature

Finding Hadamard Matrices by a Quantum Annealing Machine.

Project description:Finding a Hadamard matrix (H-matrix) among the set of all binary matrices of corresponding order is a hard problem, which potentially can be solved by quantum computing. We propose a method to formulate the Hamiltonian of finding H-matrix problem and address its implementation limitation on existing quantum annealing machine (QAM) that allows up to quadratic terms, whereas the problem naturally introduces higher order ones. For an M-order H-matrix, such a limitation increases the number of variables from M2 to (M3 + M2 - M)/2, which makes the formulation of the Hamiltonian too exhaustive to do by hand. We use symbolic computing techniques to manage this problem. Three related cases are discussed: (1) finding N < M orthogonal binary vectors, (2) finding M-orthogonal binary vectors, which is equivalent to finding a H-matrix, and (3) finding N-deleted vectors of an M-order H-matrix. Solutions of the problems by a 2-body simulated annealing software and by an actual quantum annealing hardware are also discussed.

| S-EPMC6779766 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data