Results 41 to 50 of about 649,418 (326)
On Bishop–Phelps and Krein–Milman Properties
Mathematics, 2023 A real topological vector space is said to have the Krein–Milman property if every bounded, closed, convex subset has an extreme point. In the case of every bounded, closed, convex subset is the closed convex hull of its extreme points, then we say that ...
Francisco Javier García-Pacheco
doaj +1 more source
About Directed d-Convex Simple Graphs [PDF]
Computer Science Journal of Moldova, 2008 In this article we introduce a pseudo-metric on directed graphs, which forms there a family of convex sets. The graphs without d-convex sets, except empty set, sets of one vertex and set of all vertexes, are called d-convex simple.
Nadejda Sur, Sergiu Cataranciuc
doaj
On Infinitesimal Approximation of a Continuous Function [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2010 If and are convex subsets in , and in for all . If the approximation family is the set An Infinitesimal approximation of an element in established in [4],[5].
Tahir Ismail
doaj +1 more source
Ceylon Journal of Science, 2021 The definition of the convex hull of a set of points is the smallest convex set containing all the points. Many algorithms have been proposed with the worst case time complexity is equal to O (n log n).
K. R. Wijeweera, S. R. Kodituwakku
doaj +1 more source
Convex Independence in Permutation Graphs
, 2016 A set C of vertices of a graph is P_3-convex if every vertex outside C has at most one neighbor in C. The convex hull \sigma(A) of a set A is the smallest P_3-convex set that contains A.
B Courcelle +11 more
core +1 more source
Contracting Nonlinear Observers: Convex Optimization and Learning from Data
, 2017 A new approach to design of nonlinear observers (state estimators) is proposed. The main idea is to (i) construct a convex set of dynamical systems which are contracting observers for a particular system, and (ii) optimize over this set for one which ...
anderson +4 more
core +1 more source
Covariance Estimation in Elliptical Models with Convex Structure
, 2013 We address structured covariance estimation in Elliptical distribution. We assume it is a priori known that the covariance belongs to a given convex set, e.g., the set of Toeplitz or banded matrices.
Soloveychik, Ilya, Wiesel, Ami
core +1 more source
LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies
, 2014 We extend the classical LR characterization of chirotopes of finite planar families of points to chirotopes of finite planar families of pairwise disjoint convex bodies: a map \c{hi} on the set of 3-subsets of a finite set I is a chirotope of finite ...
A Björner +45 more
core +1 more source
The External Estimate of the Compact Set by Lebesgue Set of the Convex Function [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2020 The finite-dimensional problem of embedding a given compact D ⊂ R p into the lower Lebesgue set G(α) = {y ∈ R p : f(y) 6 α} of the convex function f(·) with the smallest value of α due to the offset of D is considered.
Abramova, Veronika V. +2 more
doaj +1 more source
, 2014 We address the problem of one dimensional segment detection and estimation, in a regression setup. At each point of a fixed or random design, one observes whether that point belongs to the unknown segment or not, up to some additional noise.
Brunel, Victor-Emmanuel
core +1 more source