Related papers: The Projection Problem in Commutative, Positively …
We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…
We study linearly dependent subsets with prescribed cardinality, $s$, of a multiprojective space. If the set $S$ is a circuit, we give an upper bound on the number of factors of the minimal multiprojective space containing $S$, while if $S$…
We derive analytic formulas for the alternating projection method applied to the cone $\mathbb{S}^n_+$ of positive semidefinite matrices and an affine subspace. More precisely, we find recursive relations on parameters representing a…
We introduce the concept of multiplication matrices for ideals of projective dimension zero. We discuss various applications and in particular, we give a new algorithm to compute the variety of an ideal of projective dimension zero.
In this work, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of linear optimization over the subset of vertices of P that are not contained in X. This…
In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our…
The main result of the paper is the theorem giving a sufficient condition for the existence of a bounded analytic projection onto a holomorphic family of (generally infinite-dimensional) subspaces (a holomorphic sub-bundle of a trivial…
Shape-constrained inference has wide applicability in bioassay, medicine, economics, risk assessment, and many other fields. Although there has been a large amount of work on monotone-constrained univariate curve estimation, multivariate…
We consider optimization problems with manifold-valued constraints. These generalize classical equality and inequality constraints to a setting in which both the domain and the codomain of the constraint mapping are smooth manifolds. We…
This paper introduces the concept of metric ideals in AL-monoids. We also examine the structure of AL-monoids and describe some of the properties of homomorphism and fundamentalisomorphism theorems.Additionaly we introduce and examine a…
This paper connects discrete optimal transport to a certain class of multi-objective optimization problems. In both settings, the decision variables can be organized into a matrix. In the multi-objective problem, the notion of Pareto…
We give a finite axiomatization for the variety generated by relational, integral ordered monoids. As a corollary we get a finite axiomatization for the language interpretation as well.
We show that a direct limit of projective contramodules (over a right linear topological ring) is projective if it has a projective cover. A similar result is obtained for $\infty$-strictly flat contramodules of projective dimension not…
We completely classify all neutral or costandard elements in the lattice $\mathbb{MON}$ of all monoid varieties. Further, we prove that an arbitrary upper-modular element of $\mathbb{MON}$ except the variety of all monoids is either a…
Let $A$ be a Rees-like algebra of dimension $d$ and $N$ a commutative partially cancellative torsion-free seminormal monoid. We prove the following results. \begin{enumerate} \item Let $P$ be a finitely generated projective $A$-module of…
Polyhedral convex set optimization problems are the simplest optimization problems with set-valued objective function. Their role in set optimization is comparable to the role of linear programs in scalar optimization. Vector linear…
This paper is mainly devoted to the following question:\ Let $M,N$ be von~Neumann algebras with $M\subset N$, if there is a completely bounded projection $P\colon \ N\to M$, is there automatically a contractive projection $\widetilde…
This paper describes problems concerning the range of cardinalities of sumsets and restricted sumsets of finite subsets of the integers and finite subsets of ordered abelian groups.
The article proposes an n-dimensional mathematical model of the visual representation of a linear programming problem. This model makes it possible to use artificial neural networks to solve multidimensional linear optimization problems,…
The paper suggests a new --- to the best of the author's knowledge --- characterization of decisions which are optimal in the multi-objective optimization problem with respect to a definite proper preference cone, a Euclidean cone with a…