Results 91 to 100 of about 11,007,602 (126)

Regularity properties and integral inequalities related to (k; h1; h2)-convexity of functions

Annals of the West University of Timisoara: Mathematics and Computer Science, 2015
The class of (k; h1; h2)-convex functions is introduced, together with some particular classes of corresponding generalized convex dominated functions.
Cristescu Gabriela, Găianu Mihail, Muhammad Uzair Awan   +2 more
doaj   +1 more source

Generalised Local Fractional Hermite-Hadamard Type Inequalities on Fractal Sets

Pan-American Journal of Mathematics
Fractal geometry and analysis constitute a growing field, with numerous applications, based on the principles of fractional calculus. Fractals sets are highly effective in improving convex inequalities and their generalisations.
Peter Olamide Olanipekun
doaj   +1 more source

Convex functions on non-convex domains. [PDF]

Peters, H.J.M., Wakker, P.P.
core   +1 more source

Some quantum estimates of Hermite-Hadamard inequalities for convex functions

, 2017
Wenjun Liu, Hefeng Zhuang
semanticscholar   +1 more source

Some of the next articles are maybe not open access.

Related searches:

p-Convex Functions and Some of Their Properties

, 2021
In this paper, the concept of p-convex function based on the definition of p-convex sets is given. Then fundamental characterizations and some operational properties of p-convex functions are presented.
Sevda Sezer, Zeynep Eken, G. Tinaztepe, G. Adi̇lov   +3 more
semanticscholar   +1 more source

Subgradient Methods for Sharp Weakly Convex Functions

Journal of Optimization Theory and Applications, 2018
Subgradient methods converge linearly on a convex function that grows sharply away from its solution set. In this work, we show that the same is true for sharp functions that are only weakly convex, provided that the subgradient methods are initialized ...
Damek Davis, D. Drusvyatskiy, Kellie J. MacPhee, C. Paquette   +3 more
semanticscholar   +1 more source

Efficiency of minimizing compositions of convex functions and smooth maps

Mathematical programming, 2016
We consider global efficiency of algorithms for minimizing a sum of a convex function and a composition of a Lipschitz convex function with a smooth map.
D. Drusvyatskiy, C. Paquette
semanticscholar   +1 more source

A general system for heuristic minimization of convex functions over non-convex sets

Optim. Methods Softw., 2017
We describe general heuristics to approximately solve a wide variety of problems with convex objective and decision variables from a non-convex set. The heuristics, which employ convex relaxations, convex restrictions, local neighbour search methods, and
Steven Diamond, Reza Takapoui, Stephen P. Boyd   +2 more
semanticscholar   +1 more source

Some New Quantum Hermite–Hadamard-Like Inequalities for Coordinated Convex Functions

Journal of Optimization Theory and Applications, 2020
H. Budak, M. Ali, Meliha Tarhanaci
semanticscholar   +1 more source

On q-Hermite–Hadamard inequalities for general convex functions

, 2020
S. Bermudo, Pawel Korus, JUAN EDUARDO Nápoles Valdés   +2 more
semanticscholar   +1 more source