Related papers: The condition of a function relative to a polytope
We study the combinatorial Reeb flow on the boundary of a four-dimensional convex polytope. We establish a correspondence between "combinatorial Reeb orbits" for a polytope, and ordinary Reeb orbits for a smoothing of the polytope,…
We establish a maximum principle for a two-point function in order to analyze the convexity of level sets of harmonic functions. We show that this can be used to prove a strict convexity result involving the smallest principal curvature of…
In this paper, within a unified framework of the condition number theory we present the explicit expression of the projected condition number of the equality constrained indefinite least squares problem. By setting specific norms and…
We show that for a convex function the following, rather modest conditions, are equivalent to monotonicity under local operations and classical communication. The conditions are: 1)invariance under local unitaries, 2) invariance under…
In this paper we discuss convexity, its average principle, an extrinsic average variational method in the Calculus of Variations, an average method in Partial Differential Equations, a link of convexity to $p$-subharmonicity, subsolutions…
A rigorous and powerful theoretical framework is proposed to obtain systems of orthogonal functions (or shape modes) to represent optical surfaces. The method is general so it can be applied to different initial shapes and different…
A convex envelope for the problem of finding the best approximation to a given matrix with a prescribed rank is constructed. This convex envelope allows the usage of traditional optimization techniques when additional constraints are added…
This paper demonstrates that the space of piecewise smooth functions can be well approximated by the space of functions defined by a set of simple (non-linear) operations on smooth uniform splines. The examples include bivariate functions…
Take a random variable X with some finite exponential moments. Define an exponentially weighted expectation by E^t(f) = E(e^{tX}f)/E(e^{tX}) for admissible values of the parameter t. Denote the weighted expectation of X itself by r(t) =…
A convex relaxation of a quadratically constrained quadratic program (QCQP) is called exact if it has a rank-$1$ optimal solution that corresponds to an optimal solution of the QCQP. Given a QCQP whose convex relaxation is exact, this paper…
Theoretical estimates of the convergence rate of many well-known gradient-type optimization methods are based on quadratic interpolation, provided that the Lipschitz condition for the gradient is satisfied. In this article we obtain a…
Many numerical problems with input $x$ and output $y$ can be formulated as a system of equations $F(x, y) = 0$ where the goal is to solve for $y$. The condition number measures the change of $y$ for small perturbations to $x$. From this…
The Lebesgue property (order-continuity) of a monotone convex function on a solid vector space of measurable functions is characterized in terms of (1) the weak inf-compactness of the conjugate function on the order-continuous dual space,…
The main goal in this manuscript is to present a class of functions satisfying a certain orthogonality property for which there also exists a three term recurrence formula. This class of functions, which can be considered as an extension to…
The matrix logarithm, when applied to Hermitian positive definite matrices, is concave with respect to the positive semidefinite order. This operator concavity property leads to numerous concavity and convexity results for other matrix…
The main goal of this paper is to present results of existence and non-existence of convex functions on Riemannian manifolds and, in the case of the existence, we associate such functions to the geometry of the manifold. Precisely, we prove…
Convex functions have played a major role in the field of Mathematical inequalities. In this paper, we introduce a new concept related to convexity, which proves better estimates when the function is somehow more convex than another. In…
We study the block-coordinate forward-backward algorithm in which the blocks are updated in a random and possibly parallel manner, according to arbitrary probabilities. The algorithm allows different stepsizes along the block-coordinates to…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
Deciding whether a given function is quasiconvex is generally a difficult task. Here, we discuss a number of numerical approaches that can be used in the search for a counterexample to the quasiconvexity of a given function $W$. We will…