Results 51 to 60 of about 306 (149)
The Sum of a Linear and a Linear Fractional Function: Pseudoconvexity on the Nonnegative Orthant and Solution Methods [PDF]
The aim of the paper is to present sequential methods for a pseudoconvex optimization problem whose objective function is the sum of a linear and a linear fractional function and the feasible region is a polyhedron, not necessarily compact. Since the sum
MARTEIN, LAURA, CAROSI, LAURA
core +1 more source
On Locally Uniformly $A$-Pseudoconvex Algebras
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abel, M., Kinani, A. El, Oudadess, M.
openaire +2 more sources
New estimates of Rychkov's universal extension operator for Lipschitz domains and some applications
Abstract Given a bounded Lipschitz domain Ω⊂Rn$\Omega \subset \mathbb {R}^n$, Rychkov showed that there is a linear extension operator E$\mathcal {E}$ for Ω$\Omega$, which is bounded in Besov and Triebel‐Lizorkin spaces. In this paper, we introduce some new estimates for the extension operator E$\mathcal {E}$ and give some applications.
Ziming Shi, Liding Yao
wiley +1 more source
Hearing pseudoconvexity in Lipschitz domains with holes via $\overline\partial$
International audienceLet Ω = Ω \ D where Ω is a bounded domain with connected complement in C n (or more generally in a Stein manifold) and D is relatively compact open subset of Ω with connected complement in Ω.
Laurent-Thiébaut, Christine +5 more
core +1 more source
Closed 3‐forms in five dimensions and embedding problems
Abstract We consider the question if a five‐dimensional manifold can be embedded into a Calabi–Yau manifold of complex dimension 3 such that the real part of the holomorphic volume form induces a given closed 3‐form on the 5‐manifold. We define an open set of 3‐forms in dimension five which we call strongly pseudoconvex, and show that for closed ...
Simon Donaldson, Fabian Lehmann
wiley +1 more source
Analyticity in the boundary of a pseudoconvex domain [PDF]
Let D D be a bounded pseudoconvex domain with
openaire +1 more source
Artificial neural networks (ANNs) are widely used machine learning techniques with applications in various fields. Heuristic search optimization methods are typically used to minimize the loss function in ANNs. However, these methods can lead the network to become stuck in local optima, limiting performance.
Taninnuch Lamjiak +5 more
wiley +1 more source
Deformations of strongly pseudoconvex domains [PDF]
We show that two smoothly bounded, strongly pseudoconvex domains which are diffeomorphic may be smoothly deformed into each other, with all intermediate domains being strongly pseudoconvex. This result relates to Lempert's ideas about Kobayashi extremal discs, and also has intrinsic interest.
openaire +2 more sources
In this paper, we are thus motivated to define and introduce the extended fuzzy‐valued convex functions that can take the singleton fuzzy values −∞˜ and +∞˜ at some points. Such functions can be characterized using the notions of effective domain and epigraph.
T. Allahviranloo +7 more
wiley +1 more source
Approximate Convexity of Set-Valued Mappings and Variational Inequalities
In this article, we introduce the notion of approximate convexity for set-valued mappings, specifically in the forms of approximate pseudoconvexity and approximate quasiconvexity.
Dalal Alhwikem
doaj +1 more source

