Results 41 to 50 of about 807,538 (297)
On Generalized Strongly Convex Functions and Unified Integral Operators
In this paper, we define a strongly exponentially α , h − m -convex function that generates several kinds of strongly convex and convex functions.
Timing Yu +4 more
semanticscholar +1 more source
The second Hankel determinant for strongly convex and Ozaki close-to-convex functions
Let f be analytic in the unit disk D={z∈C:|z|
Y. Sim, A. Lecko, D. Thomas
semanticscholar +1 more source
. Sharp upper and lower bounds are found of the second and third order Hermitian Toeplitz determinants for the classes of strongly starlike and strongly convex functions of order α ( α ∈ [ 0 , 1 ) ).
B. Kowalczyk +2 more
semanticscholar +1 more source
A comprehensive review of the Hermite-Hadamard inequality pertaining to fractional differential operators [PDF]
A review on Hermite-Hadamard type inequalities connected with a different classes of convexities and fractional differential operators is presented. In the various classes of convexities it includes, classical convex functions, quasi-convex functions, p ...
Muhammad Tariq +3 more
doaj
On the converse Jensen inequality for strongly convex functions
Kazimierz Nikodem +1 more
exaly +2 more sources
Ostrowski Type Inequalities for $n$-Times Strongly $m$-$MT$-Convex Functions [PDF]
In this paper, we introduce the class of strongly $m$--$MT$-convex functions based on the identity given in [P. Cerone et al., 1999]. We establish new inequalities of the Ostrowski-type for functions whose $n^{th}$ derivatives are strongly $m$--$MT ...
Badreddine Meftah, Chayma Marrouche
doaj +1 more source
ON THE NEIGHBOURHOODS OF STRONGLY CONVEX FUNCTIONS
In this paper neighbourhoods of strongly convex and strongly starlike function are determined.
Parvatham, R., Premabai, Millicent
openaire +3 more sources
Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions [PDF]
We study the trade-offs between convergence rate and robustness to gradient errors in designing a first-order algorithm. We focus on gradient descent (GD) and accelerated gradient (AG) methods for minimizing strongly convex functions when the gradient ...
N. Aybat +3 more
semanticscholar +1 more source
Convex Analysis for Minimizing and Learning Submodular Set Functions [PDF]
The connections between convexity and submodularity are explored, for purposes of minimizing and learning submodular set functions. First, we develop a novel method for minimizing a particular class of submodular functions, which can be expressed as a
Peter Stobbe, Stobbe, Peter
core +1 more source
A Robust Accelerated Optimization Algorithm for Strongly Convex Functions [PDF]
This work proposes an accelerated first-order algorithm we call the Robust Momentum Method for optimizing smooth strongly convex functions. The algorithm has a single scalar parameter that can be tuned to trade off robustness to gradient noise versus ...
Saman Cyrus +3 more
semanticscholar +1 more source

