Related papers: Convex-compactness and its applications
We show a Dvoretsky-Rogers type Theorem for the adapted version of the $q$-summing operators to the topology of the convergence of the vector valued integrals on Banach function spaces. In the pursuit of this objective we prove that the…
Many practical optimization problems lack strong convexity. Fortunately, recent studies have revealed that first-order algorithms also enjoy linear convergences under various weaker regularity conditions. While the relationship among…
We establish lower semi-continuity and strict convexity of the energy functionals for a large class of vector equilibrium problems in logarithmic potential theory. This in particular implies the existence and uniqueness of a minimizer for…
There are several extensions of the classical Banach Fixed Point Theorem in technical literature. A branch of generalizations replaces usual contractivity by weaker but still effective assumptions. Our note follows this stream, presenting…
In this paper, we introduce methods from convex optimization to solve the multimarginal transport type problems arise in the context of density functional theory. Convex relaxations are used to provide outer approximation to the set of…
In this paper, we study local convergence of high-order Tensor Methods for solving convex optimization problems with composite objective. We justify local superlinear convergence under the assumption of uniform convexity of the smooth…
A generalized topology in a set $X$ is a collection $\text{Cov}_X$ of families of subsets of $X$ such that the triple $(X,\bigcup \text{Cov}_X,\text{Cov}_X)$ is a generalized topological space in the sense of Delfs and Knebusch. In this…
In this paper, we prove first that the iterates of a mean nonexpansive map defined on a weakly compact, convex set converge weakly to a fixed point in the presence of Opial's property and asymptotic regularity at a point. Next, we prove the…
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…
We quickly review and make some comments on the concept of convexity in metric spaces due to Takahashi. Then we introduce a concept of convex structure based convexity to functions on these spaces and refer to it as $W-$convexity.…
Under study are some vector optimization problems over the space of Minkowski balls, i.e., symmetric convex compact subsets in Euclidean space. A typical problem requires to achieve the best result in the presence of conflicting goals;…
Convex optimization problems arise naturally in quantum information theory, often in terms of minimizing a convex function over a convex subset of the space of hermitian matrices. In most cases, finding exact solutions to these problems is…
In this paper, we propose new proximal Newton-type methods for convex optimization problems in composite form. The applications include model predictive control (MPC) and embedded MPC. Our new methods are computationally attractive since…
We generalize the dual notions of "expansion" and "collapse" so they can be applied to arbitrary metric spaces. We also expand the theory to allow for infinitely many such moves. Those tools are then employed to prove a variety of…
Let $E$ be a Banach space such that $E'$ has the Radon-Nikod\'ym property. The aim of this work is to connect relative weak compactness in the $E$-valued martingale Hardy space $H^{1}(\mu,E)$ to a convex compactness criterion in a weaker…
A method of proving local continuity of concave functions on convex set possessing the $\mu$-compactness property is presented. This method is based on a special approximation of these functions. The class of $\mu$-compact sets can be…
The strong contraction mapping, a self-mapping that the range is always a subset of the domain, admits a unique fixed-point which can be pinned down by the iteration of the mapping. We introduce a topological non-convex optimization method…
Having studied families of antiderivatives and their envelopes in the setting of classical convex analysis, we now extend and apply these notions and results in settings of abstract convex analysis. Given partial data regarding a…
A new convenient method of describing flat convex compact sets is proposed. It generalizes classical trigonometric functions $\sin$ and $\cos$. Apparently, this method may be very useful for explicit description of solutions of optimal…
In this paper the theory of uniformly convex metric spaces is developed. These spaces exhibit a generalized convexity of the metric from a fixed point. Using a (nearly) uniform convexity property a simple proof of reflexivity is presented…