Results 11 to 20 of about 6,990,145 (303)
The quickhull algorithm for convex hulls
C. Barber, D. Dobkin, H. Huhdanpaa
semanticscholar +3 more sources
Level-set methods for convex optimization [PDF]
Convex optimization problems arising in applications often have favorable objective functions and complicated constraints, thereby precluding first-order methods from being immediately applicable.
A. Aravkin +4 more
semanticscholar +1 more source
This paper will analyze convex functions. In particular, it will investigate criteria for convexity. The investigation will list the criteria from the weakest to the strongest based on theorems, definitions, propositions, and various examples. The theory
Susanna Maria Zagar
semanticscholar +1 more source
On aNew Class of Meromorphically Univalent Functions with Applications to Geometric Functions [PDF]
In this work, we inform a new class of meromorphic univalent function.We derive basic properties such ascoefficient estimates, convex set, extremepoints, radius of starlikeness and convexity, hadamard product, integraloperator,
M. Lafta, K. AL- Zubaidy
doaj +1 more source
Error Function and Certain Subclasses of Analytic Univalent Functions [PDF]
In the present investigation, our main aim is to introduce a certain subclass of analytic univalent functions related to the Error function. We discuss the implications of our main results, including the coefficient bound, extreme points, weighted mean ...
Seyed Hadi Sayedain Boroujeni +1 more
doaj +1 more source
Relationships Between Polyhedral Convex Sets and Generalized Polyhedral Convex Sets
In this paper we study some relationships between polyhedral convex sets (PCS) and generalized polyhedral convex sets (GPCS). In particular, we clarify by a counterexample that the necessary and sufficient conditions for the separation of a convex set and a PCS obtained by Kung Fu Ng and Wen Song in [Fenchel duality in finite-dimensional setting and ...
Nguyen Ngoc Luan +3 more
openaire +4 more sources
Exact Matrix Completion via Convex Optimization [PDF]
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M.
E. Candès, B. Recht
semanticscholar +1 more source
A new area of research called intuitionistic fuzzy soft expert set is expected to overcome the drawbacks of an intuitionistic fuzzy soft set in terms of eligibility for soft expert-argument approximate function.
Muhammad Ihsan +3 more
doaj +1 more source
Point Cloud Repair Method via Convex Set Theory
The point cloud is the basis for 3D object surface reconstruction. An incomplete point cloud significantly reduces the accuracy of downstream work such as 3D object reconstruction and recognition.
Tianzhen Dong +3 more
doaj +1 more source
Fuglede's spectral set conjecture for convex polytopes [PDF]
Let $\Omega$ be a convex polytope in $\mathbb{R}^d$. We say that $\Omega$ is spectral if the space $L^2(\Omega)$ admits an orthogonal basis consisting of exponential functions.
Rachel Greenfeld, Nir Lev
semanticscholar +1 more source

