Results 81 to 90 of about 11,050,393 (374)
Relatively Smooth Convex Optimization by First-Order Methods, and Applications [PDF]
The usual approach to developing and analyzing first-order methods for smooth convex optimization assumes that the gradient of the objective function is uniformly smooth with some Lipschitz constant $L$.
Haihao Lu, R. Freund, Y. Nesterov
semanticscholar +1 more source
Root Function and Convex Function
Many authors [1], [2], [3], [4] considered the problems under different weak conditions which imply the continuity of the functions. In this section, we will consider convex functions on a commutative topological group with a root function.
openaire +4 more sources
Approximately convex functions [PDF]
So far we have discussed the stability of various functional equations. In the present section, we consider the stability of a well-known functional inequality, namely the inequality defining convex functions: $$f\left( {\lambda x + \left( {1 - \lambda } \right)y} \right) \leqslant \lambda f\left( x \right) + \left( {1 - \lambda } \right)f\left( y \
Stanislaw M. Ulam, Donald H. Hyers
openaire +2 more sources
A universal bound on the variations of bounded convex functions [PDF]
Given a convex set $C$ in a real vector space $E$ and two points $x,y\in C$, we investivate which are the possible values for the variation $f(y)-f(x)$, where $f:C\longrightarrow [m,M]$ is a bounded convex function. We then rewrite the bounds in terms of
Kwon, Joon
core
For a function defined on a convex set in a Euclidean space, midpoint convexity is the property requiring that the value of the function at the midpoint of any line segment is not greater than the average of its values at the endpoints of the line ...
Moriguchi, Satoko+3 more
core +1 more source
Picosecond direct laser interference patterning (DLIP) enables precise microstructure fabrication on stainless steel. Using a multiscan approach, high‐aspect‐ratio patterns are achieved. Fluence influences structure growth and homogeneity, with smaller periods yielding better uniformity.
Fabian Ränke+5 more
wiley +1 more source
Unification of Generalized and p-Convexity
In the present note, we will introduce the definition of generalized p convex function. We will investigate some properties of generalized p convex function.
Chahn Yong Jung+5 more
doaj +1 more source
Quasi Semi and Pseudo Semi (p,E)-Convexity in Non-Linear Optimization Programming
The class of quasi semi -convex functions and pseudo semi -convex functions are presented in this paper by combining the class of -convex functions with the class of quasi semi -convex functions and pseudo semi -convex functions, respectively.
Revan I. Hazim, Saba N. Majeed
doaj +1 more source
This study explores the effects of pixel size and spacing when fabricating electroluminescent (EL) multipixel displays. COMSOL simulations identify the impact of pixel dimensions and spacing on electric field distribution and lighting efficiency. Flexible, high‐resolution EL pixel arrays are reverse offset printed, achieving a 96% reduction in pixel ...
Huanghao Dai+3 more
wiley +1 more source
Subordination by convex functions
Let K(α), 0 ...
Ram Singh, Sukhjit Singh
doaj +1 more source