Related papers: A Note on the Chebyshev Set Problem in Normed Line…
The aim of this paper is to give two complete and simple characterizations of Minkowski norms N on an arbitrary topological real vector space such that the sublevel sets of N are strictly convex. We first show that this property is…
Let $H$ be a reflexive, dense, separable, infinite dimensional complex Hilbert space and let $B(H)$ be the algebra of all bounded linear operators on $H$. In this paper, we carry out characterizations of norm-attainable operators in normed…
We systematically investigate the farthest distance function, farthest points, Klee sets, and Chebyshev centers, with respect to Bregman distances induced by Legendre functions. These objects are of considerable interest in Information…
Stability of nonconvex quadratic programming problems under finitely many convex quadratic constraints in Hilbert spaces is investigated. We present several stability properties of the global solution map, and the continuity of the optimal…
In Euclidean spaces, the geometric notions of nearest-points map, farthest-points map, Chebyshev set, Klee set, and Chebyshev center are well known and well understood. Since early works going back to the 1930s, tremendous theoretical…
Let \Gamma be a structure with a finite relational signature and a first-order definition in (R;*,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article,…
One of the central open problems to classify the computational complexity of finite-domain constraint satisfaction problems within P is to prove better algorithmic results for CSPs with a Maltsev polymorphism; we do not even know whether…
We establish a necessary and sufficient condition for the differentiability of the distance function generated by a nonempty closed set K in a real normed linear space X under a proximinality condition on K. We do not assume the uniform…
It is well known that every convex body in a finite dimensional normed space can be uniformly approximated by strictly convex and smooth convex bodies. However, in the case of infinite dimensions, little progress has been made since Klee…
Many problems of theoretical and practical interest involve finding a convex or concave function. For instance, optimization problems such as finding the projection on the convex functions in $H^k(\Omega)$, or some problems in economics. In…
In this paper we completely characterize the norm attainment set of a bounded linear operator on a Hilbert space. This partially answers a question raised recently in [\textit{D. Sain, On the norm attainment set of a bounded linear…
The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets is developed. In particular, it is shown that this concept is useful in the study of best…
Constrained Optimization solution algorithms are restricted to point based solutions. In practice, single or multiple objectives must be satisfied, wherein both the objective function and constraints can be non-convex resulting in multiple…
With the development of robotics, there are growing needs for real time motion planning. However, due to obstacles in the environment, the planning problem is highly non-convex, which makes it difficult to achieve real time computation…
For a topological space X, let (RX)s := (RX,Ts) be the cartesian product of |X| copies of the real line R with the topology of the uniform convergence on separable subsets of X. In this article we analyze the subspace C(X) of (RX)s of all…
The representer theorem is one of the most important mathematical foundations for regularised learning and kernel methods. Classical formulations of the theorem state sufficient conditions under which a regularisation problem on a Hilbert…
We study maximal regularity with respect to continuous functions for strongly continuous semigroups on locally convex spaces as well as its relation to the notion of admissible operators. This extends several results for classical strongly…
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…
A characterization of the proximal normal cone is obtained and a separation theorem for convex subsets of Riemannian manifolds is established. Moreover, the convexity of the distance function $d_S$ for a convex subset $S$ in the cases where…
The problem of characterizing normed ordered spaces which admit a representation in the algebraic, order and norm sense as a subspace of $C(X)$, the space of all continuous functions on a compact Hausdorff space is a classical problem that…