Results 41 to 50 of about 497,650 (327)
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 \
Hyers, D. H., Ulam, S. M.
openaire +2 more sources
Scoliosis Surgery in a Patient With Advanced Friedreich's Ataxia—It Is Not Too Late
ABSTRACT Friedreich's ataxia is a multisystem disorder with scoliosis being the most common non‐neurological manifestation. While scoliosis surgery is typically performed in adolescent, ambulatory patients, few data exist on surgical outcomes in patients with advanced disease.
Kathrin Reetz +20 more
wiley +1 more source
Insights Into the Antigenic Repertoire of Unclassified Synaptic Antibodies
ABSTRACT Objective We sought to characterize the sixth most common finding in our neuroimmunological laboratory practice (tissue assay‐observed unclassified neural antibodies [UNAs]), combining protein microarray and phage immunoprecipitation sequencing (PhIP‐Seq). Methods Patient specimens (258; 133 serums; 125 CSF) meeting UNA criteria were profiled;
Michael Gilligan +22 more
wiley +1 more source
Subordination by convex functions [PDF]
The following theorem is proven: Let F ( z ) F(z) be convex and univalent in Δ = { z : | z | > 1 } , F ( 0 ) = 1 \Delta = \{ z:|z| > 1\} ,F(0)
Hallenbeck, D. J., Ruscheweyh, Stephan
openaire +2 more sources
Data‐Driven Distributed Safe Control Design for Multi‐Agent Systems
This paper presents a data‐driven control barrier function (CBF) technique for ensuring safe control of multi‐agent systems (MASs) with uncertain linear dynamics. A data‐driven quadratic programming (QP) optimization is first developed for CBF‐based safe control of single‐agent systems using a nonlinear controller. This approach is then extended to the
Marjan Khaledi, Bahare Kiumarsi
wiley +1 more source
Approximation of Convex Functions
It is known [\textit{M. Ghomi}, Proc. Am. Math. Soc. 130, No.~8, 2255--2259 (2002; Zbl 0999.26008)] that every convex function on an open interval \(I\) can be uniformly approximated by convex \(C^\infty\)-functions on every compact subinterval \([a,b]\) of \(I\). Ghomi's approach requires the knowledge of Lebesgue integral and convolutions. The aim of
openaire +2 more sources
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
Some concepts of generalized convex functions (I)
An extension of the concept of convex function is given in a very general framework provided by a set in which a general convexity for its subsets is defined.
Liana Lupşa, Gabriela Cristescu
doaj +2 more sources

