Results 71 to 80 of about 11,287,559 (375)
This paper proposes two projector‐based Hopfield neural network (HNN) estimators for online, constrained parameter estimation under time‐varying data, additive disturbances, and slowly drifting physical parameters. The first is a constraint‐aware HNN that enforces linear equalities and inequalities (via slack neurons) and continuously tracks the ...
Miguel Pedro Silva
wiley +1 more source
Valuations on Convex Functions [PDF]
All continuous, SL$(n)$ and translation invariant valuations on the space of convex functions on ${\mathbb R}^n$ are completely classified.
Andrea Colesanti +2 more
openaire +3 more sources
Fabrication‐Directed Entanglement for Designing Chiral and Anisotropic Metamaterial Foams
This work introduces fabrication‐directed entanglement (FDE), combining viscous thread printing and topology optimization to program entangled foams with spatially patterned stiffness. By tuning coil density, FDE enables anisotropy, programmable Poisson's ratio, and chirality in foams.
Daniel Revier +3 more
wiley +1 more source
In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is nonconvex and it can be written as the difference of two convex functions. The proposed
Chatzinotas, Symeon +3 more
core +1 more source
In this paper, we give two weak conditions for a lower semi-continuous function on the n-dimensional Euclidean space Rn to be a convex function. We also present some results for convex functions, strictly convex functions, and quasi-convex functions.
Yu-Ru Syau
doaj +1 more source
In this paper, we introduce the notion of exponentially p-convex function and exponentially s-convex function in the second sense. We establish several Hermite–Hadamard type inequalities for exponentially p-convex functions and exponentially s-convex ...
Naila Mehreen, Matloob Anwar
doaj +1 more source
An Inequality for Convex Functions
The authors prove the following interesting inequality for convex functions: Suppose that positive numbers \(s_{i,j}\) \((i= 0,1,2; j= 1,\dots,n)\) satisfy \(s_{1,j}\leq s_{0,j}\leq s_{2,j}\) \((j= 1,\dots,n)\) and \(a_ j s^{-1}_{i,1}+ b_ j s^{-1}_{i,j}= 1\) \((i= 0,1,2; j= 2,\dots,n)\) for positive constants \(a_ j\), \(b_ j\) \((j= 2,\dots,n)\). If \(
Pearce, C.E.M., Pecaric, J.E.
openaire +2 more sources
This study investigates laser shock peening for enhancing fatigue performance of riveted aerospace aluminum joints. A comparative approach with cold expansion combines fatigue testing and synchrotron X‐ray methods. Integrating mechanical testing with residual stress and strain characterization provides insights into how different treatments affect the ...
Ogün Baris Tapar +6 more
wiley +1 more source
Fixed points in the family of convex representations of a maximal monotone operator
Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation.
Svaiter, B. F.
core +1 more source
Length problems for Bazilevič functions
Let C(r) denote the curve which is image of the circle |z| = r < 1 under the mapping f . Let L(r) be the length of C(r) and A(r) the area enclosed by the curve C(r).
Nunokawa Mamoru +2 more
doaj +1 more source

